Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alexandru Mateescu
2000 – 2009
- 2006
[j42]Erzsébet Csuhaj-Varjú, Alexandru Mateescu: On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra. Fundam. Inform. 73(1-2): 37-50 (2006)- [j41]Alexandru Mateescu, Rudolf Freund: Routes and Products of Monoids. Fundam. Inform. 73(1-2): 205-211 (2006)
- 2004
- [j40]Alexandru Mateescu, Arto Salomaa: Matrix Indicators For Subword Occurrences And Ambiguity. Int. J. Found. Comput. Sci. 15(2): 277-292 (2004)
- [j39]Alexandru Mateescu, Arto Salomaa, Sheng Yu: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004)
- [c23]
- 2002
- [j38]Alexandru Mateescu, Arto Salomaa, Sheng Yu: Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15(3): 339-351 (2002)
- [j37]Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu: On the Injectivity of the Parikh Matrix Mapping. Fundam. Inform. 49(4): 289-299 (2002)
- [j36]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
- [j35]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: A sharpening of the Parikh mapping. ITA 35(6): 551-564 (2001)
- [j34]Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu: Codifiable Languages and the Parikh Matrix Mapping. J. UCS 7(8): 783-793 (2001)
- [p2]Alexandru Mateescu, Arto Salomaa: Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring. Current Trends in Theoretical Computer Science 2001: 693-707
- [p1]Alexandru Mateescu: Words on Trajectories. Current Trends in Theoretical Computer Science 2001: 752-770
- [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
- 2000
- [j33]Carlos Martín-Vide, Alexandru Mateescu: Contextual Generalized Sequential Machines. Bulletin of the EATCS 72: 159-168 (2000)
- [j32]Alexandru Mateescu, Kai Salomaa, Sheng Yu: On Fairness of Many-Dimensional Trajectories. Journal of Automata, Languages and Combinatorics 5(2): 145-158 (2000)
- [j31]Carlos Martín-Vide, Alexandru Mateescu: Special Families of Sewing Languages. Journal of Automata, Languages and Combinatorics 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]
1990 – 1999
- 1999
- [j30]Alexandru Mateescu, Arto Salomaa: Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. Bulletin of the EATCS 68: 134-150 (1999)
- [j29]
- [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]
- 1998
- [j28]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Simple Splicing Systems. Discrete Applied Mathematics 84(1-3): 145-163 (1998)
- [j27]Carlos Martín-Vide, Alexandru Mateescu, Gheorghe Paun: Hybrid Grammars: The Chomsky-Marcus Case. Bulletin of the EATCS 64 (1998)
- [j26]
- [j25]Manfred Kudlek, Alexandru Mateescu: Algebraic, Linear and Rational Languages Defined by Mix Operation. Fundam. Inform. 33(3): 249-264 (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]
- [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]
- [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
- 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-234 (1996)
- [j19]
- [j18]Jonathan S. Golan, Alexandru Mateescu, Dragos Vaida: Semirings and Parallel Composition of Processes. Journal of Automata, Languages and Combinatorics 1(3): 199-218 (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. ITA 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. UCS 1(5): 292-311 (1995)
- [j12]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Parikh Prime Words and GO-like Territories. J. UCS 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]
- 1994
- [j10]Alexandru Mateescu, Arto Salomaa: Finite Degrees of Ambiguity in Pattern Languages. ITA 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]
- 1993
- [j8]Alexandru Mateescu, Arto Salomaa: On Simplest Possible Solutions for Post Correspondence Problems. Acta Inf. 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. Bulletin of the EATCS 49: 130-142 (1993)
- [j5]Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun: Deletion Sets. Fundam. Inform. 19(3/4): 355-370 (1993)
- [j4]
- [c2]
- [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-254 (1992)
- 1991
- [j2]Alexandru Mateescu: Special Families of Matrix Languages and Decidable Problems. Acta Cybern. 10(1-2): 45-52 (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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:02 CET by the dblp team