default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandru Mateescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j45]Erzsébet Csuhaj-Varjú, Alexandru Mateescu:
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra. Fundam. Informaticae 73(1-2): 37-50 (2006)- [j44]Alexandru Mateescu, Rudolf Freund:
Routes and Products of Monoids. Fundam. Informaticae 73(1-2): 205-211 (2006) - 2004
- [j43]Alexandru Mateescu, Arto Salomaa:
Matrix Indicators For Subword Occurrences And Ambiguity. Int. J. Found. Comput. Sci. 15(2): 277-292 (2004) - [j42]Alexandru Mateescu, Arto Salomaa, Sheng Yu:
Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004) - [c23]Alexandru Mateescu:
Algebraic Aspects of Parikh Matrices. Theory Is Forever 2004: 170-180 - 2002
- [j41]Alexandru Mateescu, Arto Salomaa, Sheng Yu:
Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15(3): 339-351 (2002) - [j40]Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu:
On the Injectivity of the Parikh Matrix Mapping. Fundam. Informaticae 49(4): 289-299 (2002) - [j39]Carlos Martín-Vide, Alexandru Mateescu, Victor Mitrana
:
Parallel Finite Automata Systems Communicating by States. Int. J. Found. Comput. Sci. 13(5): 733-749 (2002) - [c22]Alexandru Mateescu, Arto Salomaa:
Nondeterministic Trajectories. Formal and Natural Computing 2002: 96-106 - 2001
- [j38]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
A sharpening of the Parikh mapping. RAIRO Theor. Informatics Appl. 35(6): 551-564 (2001) - [j37]Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu:
Codifiable Languages and the Parikh Matrix Mapping. J. Univers. Comput. Sci. 7(8): 783-793 (2001) - [c21]Carlos Martín-Vide, Alexandru Mateescu, Arto Salomaa:
Sewing contexts and mildly context-sensitive languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 75-84 - [p6]Alexandru Mateescu, Arto Salomaa:
Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring. Current Trends in Theoretical Computer Science 2001: 693-707 - [p5]Alexandru Mateescu:
Words on Trajectories. Current Trends in Theoretical Computer Science 2001: 752-770 - 2000
- [j36]Carlos Martín-Vide, Alexandru Mateescu:
Contextual Generalized Sequential Machines. Bull. EATCS 72: 159-168 (2000) - [j35]Alexandru Mateescu, Kai Salomaa, Sheng Yu:
On Fairness of Many-Dimensional Trajectories. J. Autom. Lang. Comb. 5(2): 145-157 (2000) - [j34]Carlos Martín-Vide, Alexandru Mateescu:
Special Families of Sewing Languages. J. Autom. Lang. Comb. 5(3): 279-286 (2000) - [c20]Pál Dömösi, Alexandru Mateescu:
On Slender Context-Free Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 97-103 - [c19]Alexandru Mateescu:
Routes and Trajectories. Words, Languages & Combinatorics 2000: 323-338 - [p4]Rudolf Freund, Alexandru Mateescu, Arto Salomaa:
Algebraic Representations of Regular Array Languages. Finite Versus Infinite 2000: 127-148
1990 – 1999
- 1999
- [j33]Alexandru Mateescu, Arto Salomaa:
Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. Bull. EATCS 68: 134-150 (1999) - [j32]Carlos Martín-Vide, Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Contexts on trajectories. Int. J. Comput. Math. 73(1): 15-36 (1999) - [j31]Alexandru Mateescu:
J.UCS Special Issue on Formal Languages and Automata. J. Univers. Comput. Sci. 5(9): 493 (1999) - [c18]Alexandru Mateescu, George Daniel Mateescu:
Fair and Associative Infinite Trajectories. Jewels are Forever 1999: 327-338 - [c17]Carlos Martín-Vide, Alexandru Mateescu:
Contextual grammars with trajectories. Developments in Language Theory 1999: 362-374 - [c16]Carlos Martín-Vide, Alexandru Mateescu:
Sewing Grammars. FCT 1999: 398-408 - 1998
- [j30]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Simple Splicing Systems. Discret. Appl. Math. 84(1-3): 145-163 (1998) - [j29]Carlos Martín-Vide, Alexandru Mateescu, Gheorghe Paun:
Hybrid Grammars: The Chomsky-Marcus Case. Bull. EATCS 64 (1998) - [j28]Alexandru Mateescu:
Words on Trajectories. Bull. EATCS 65: 118-135 (1998) - [j27]Manfred Kudlek, Alexandru Mateescu:
Algebraic, Linear and Rational Languages Defined by Mix Operation. Fundam. Informaticae 33(3): 249-264 (1998) - [j26]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Characterizations of re languages starting from internal contextual languages. Int. J. Comput. Math. 66(3-4): 179-197 (1998) - [j25]Alexandru Mateescu, George Daniel Mateescu:
Associative closure and periodicity of $\omega $-words. RAIRO Theor. Informatics Appl. 32(4-6): 153-174 (1998) - [j24]Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Shuffle on Trajectories: Syntactic Constraints. Theor. Comput. Sci. 197(1-2): 1-56 (1998) - [c15]Tero Harju, Alexandru Mateescu, Arto Salomaa:
Shuffle on Trajectories: The Schützenberger Product and Related Operations. MFCS 1998: 503-511 - [c14]Alexandru Mateescu:
Shuffle of omega-Words: Algebraic Aspects (Extended Abstract). STACS 1998: 150-160 - 1997
- [j23]Alexandru Mateescu:
CD Grammar Systems and Trajectories. Acta Cybern. 13(2): 141-157 (1997) - [j22]Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Geometric Transformations on Language Families: The Power of Symmetry. Int. J. Found. Comput. Sci. 8(1): 1-14 (1997) - [j21]Manfred Kudlek, Alexandru Mateescu:
On Distributed Catenation. Theor. Comput. Sci. 180(1-2): 341-352 (1997) - [c13]Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Syntactic and Semantic Aspects of Parallelism. Foundations of Computer Science: Potential - Theory - Cognition 1997: 79-105 - [c12]Alexandru Mateescu, George Daniel Mateescu:
Associative Shuffle of Infinite Words. Structures in Logic and Computer Science 1997: 291-307 - [c11]Alexandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Shuffle-like Operations on omega-words. New Trends in Formal Languages 1997: 395-411 - [c10]Manfred Kudlek, Alexandru Mateescu:
On Mix Operation. New Trends in Formal Languages 1997: 430-439 - [c9]Alexandru Mateescu, Kai Salomaa, Sheng Yu:
Decidability of fairness for context-free languages. Developments in Language Theory 1997: 351-364 - [c8]Alexandru Mateescu, George Daniel Mateescu:
Infinite trajectories. Developments in Language Theory 1997: 489-505 - [c7]Manfred Kudlek, Solomon Marcus, Alexandru Mateescu:
Contextual Grammars with Distributed Catenation and Shuffle. FCT 1997: 269-280 - [p3]Alexandru Mateescu, Arto Salomaa:
Formal Languages: an Introduction and a Synopsis. Handbook of Formal Languages (1) 1997: 1-39 - [p2]Alexandru Mateescu, Arto Salomaa:
Aspects of Classical Language Theory. Handbook of Formal Languages (1) 1997: 175-251 - 1996
- [j20]Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
On Representing RE Languages by One-Sided Internal Contextual Languages. Acta Cybern. 12(3): 217-233 (1996) - [j19]Alexandru Mateescu, Arto Salomaa:
Views on Linguistics. Bull. EATCS 58 (1996) - [j18]Jonathan S. Golan, Alexandru Mateescu, Dragos Vaida:
Semirings and Parallel Composition of Processes. J. Autom. Lang. Comb. 1(3): 199-217 (1996) - [j17]Tero Harju, Marjo Lipponen, Alexandru Mateescu:
Flatwords and Post Correspondence Problem. Theor. Comput. Sci. 161(1&2): 93-108 (1996) - 1995
- [j16]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
P, NP and the Post Correspondence Problem. Inf. Comput. 121(2): 135-142 (1995) - [j15]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
On Parallel Deletions Applied to a Word. RAIRO Theor. Informatics Appl. 29(2): 129-144 (1995) - [j14]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Teams in cooperating grammar systems. J. Exp. Theor. Artif. Intell. 7(4): 347-359 (1995) - [j13]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. Univers. Comput. Sci. 1(5): 292-311 (1995) - [j12]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Parikh Prime Words and GO-like Territories. J. Univers. Comput. Sci. 1(12): 790-810 (1995) - [j11]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Multi-Pattern Languages. Theor. Comput. Sci. 141(1&2): 253-268 (1995) - [c6]Manfred Kudlek, Alexandru Mateescu:
Rational and Algebraic Languages with Distributed Catenation. Developments in Language Theory 1995: 129-138 - [c5]Manfred Kudlek, Alexandru Mateescu:
Distributed Catenation and Chomsky Hierarchy. FCT 1995: 313-322 - 1994
- [j10]Alexandru Mateescu, Arto Salomaa:
Finite Degrees of Ambiguity in Pattern Languages. RAIRO Theor. Informatics Appl. 28(3-4): 233-253 (1994) - [j9]Alexandru Mateescu:
Scattered Deletion and Commutativity. Theor. Comput. Sci. 125(2): 361-371 (1994) - [c4]Alexandru Mateescu:
On (Left) Partial Shuffle. Results and Trends in Theoretical Computer Science 1994: 264-278 - [c3]Alexandru Mateescu, Arto Salomaa:
Nondeterminism in Patterns. STACS 1994: 661-668 - [p1]Alexandru Mateescu:
Marcus Contextual Grammars with Shuffled Contexts. Mathematical Aspects of Natural and Formal Languages 1994: 275-284 - 1993
- [j8]Alexandru Mateescu, Arto Salomaa:
On Simplest Possible Solutions for Post Correspondence Problems. Acta Informatica 30(5): 441-457 (1993) - [j7]Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun:
Gramars with Oracles. Sci. Ann. Cuza Univ. 2: 3-12 (1993) - [j6]Alexandru Mateescu:
The Splendour of an Old Ballad: Aad van Wijngaarden Grammars. Bull. EATCS 49: 130-142 (1993) - [j5]Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun:
Deletion Sets. Fundam. Informaticae 19(3/4): 355-370 (1993) - [j4]Alexandru Mateescu, Arto Salomaa:
PCP-Prime Words and Primality Types. RAIRO Theor. Informatics Appl. 27(1): 57-70 (1993) - [c2]Alexandru Mateescu:
On Scattered Syntactic Monoids. FCT 1993: 386-395 - [c1]Alexandru Mateescu, Arto Salomaa:
Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. MFCS 1993: 174-184 - 1992
- [j3]Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. Acta Cybern. 10(4): 243-253 (1992) - 1991
- [j2]Alexandru Mateescu:
Special Families of Matrix Languages and Decidable Problems. Acta Cybern. 10(1-2): 45-51 (1991)
1980 – 1989
- 1989
- [j1]Alexandru Mateescu, Gheorghe Paun:
On fully initial grammars with regulated rewriting. Acta Cybern. 9(2): 157-165 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
