 | 2006 |
|---|
| 64 |       | Alexandru Mateescu,
Rudolf Freund:
Routes and Products of Monoids.
Fundam. Inform. 73(1-2): 205-211 (2006) |
| 63 | | 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) |
| 2004 |
|---|
| 62 | | Alexandru Mateescu:
Algebraic Aspects of Parikh Matrices.
Theory Is Forever 2004: 170-180 |
| 61 | | Alexandru Mateescu,
Arto Salomaa:
Matrix Indicators For Subword Occurrences And Ambiguity.
Int. J. Found. Comput. Sci. 15(2): 277-292 (2004) |
| 60 | | Alexandru Mateescu,
Arto Salomaa,
Sheng Yu:
Subword histories and Parikh matrices.
J. Comput. Syst. Sci. 68(1): 1-21 (2004) |
| 2002 |
|---|
| 59 | | Alexandru Mateescu,
Arto Salomaa:
Nondeterministic Trajectories.
Formal and Natural Computing 2002: 96-106 |
| 58 | | Alexandru Mateescu,
Arto Salomaa,
Sheng Yu:
Factorizations of Languages and Commutativity Conditions.
Acta Cybern. 15(3): 339-351 (2002) |
| 57 |  | Adrian Atanasiu,
Carlos Martín-Vide,
Alexandru Mateescu:
On the Injectivity of the Parikh Matrix Mapping.
Fundam. Inform. 49(4): 289-299 (2002) |
| 56 | | 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) |
| 2001 |
|---|
| 55 | | Alexandru Mateescu,
Arto Salomaa:
Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring.
Current Trends in Theoretical Computer Science 2001: 693-707 |
| 54 | | Alexandru Mateescu:
Words on Trajectories.
Current Trends in Theoretical Computer Science 2001: 752-770 |
| 53 | | Alexandru Mateescu,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
A sharpening of the Parikh mapping.
ITA 35(6): 551-564 (2001) |
| 52 | | Adrian Atanasiu,
Carlos Martín-Vide,
Alexandru Mateescu:
Codifiable Languages and the Parikh Matrix Mapping.
J. UCS 7(8): 783-793 (2001) |
| 2000 |
|---|
| 51 | | Pál Dömösi,
Alexandru Mateescu:
On Slender Context-Free Languages.
Recent Topics in Mathematical and Computational Linguistics 2000: 97-103 |
| 50 | | Carlos Martín-Vide,
Alexandru Mateescu:
Contextual Generalized Sequential Machines.
Bulletin of the EATCS 72: 159-168 (2000) |
| 49 | | Alexandru Mateescu,
Kai Salomaa,
Sheng Yu:
On Fairness of Many-Dimensional Trajectories.
Journal of Automata, Languages and Combinatorics 5(2): 145-158 (2000) |
| 48 | | Carlos Martín-Vide,
Alexandru Mateescu:
Special Families of Sewing Languages.
Journal of Automata, Languages and Combinatorics 5(3): 279-286 (2000) |
| 1999 |
|---|
| 47 | | Carlos Martín-Vide,
Alexandru Mateescu:
Contextual grammars with trajectories.
Developments in Language Theory 1999: 362-374 |
| 46 | | Carlos Martín-Vide,
Alexandru Mateescu:
Sewing Grammars.
FCT 1999: 398-408 |
| 45 | | Alexandru Mateescu,
George Daniel Mateescu:
Fair and Associative Infinite Trajectories.
Jewels are Forever 1999: 327-338 |
| 44 | | Alexandru Mateescu,
Arto Salomaa:
Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring.
Bulletin of the EATCS 68: 134-150 (1999) |
| 43 | | Alexandru Mateescu:
J.UCS Special Issue on Formal Languages and Automata.
J. UCS 5(9): 493 (1999) |
| 1998 |
|---|
| 42 | | Tero Harju,
Alexandru Mateescu,
Arto Salomaa:
Shuffle on Trajectories: The Schützenberger Product and Related Operations.
MFCS 1998: 503-511 |
| 41 | | Alexandru Mateescu:
Shuffle of omega-Words: Algebraic Aspects (Extended Abstract).
STACS 1998: 150-160 |
| 40 | | Carlos Martín-Vide,
Alexandru Mateescu,
Gheorghe Paun:
Hybrid Grammars: The Chomsky-Marcus Case.
Bulletin of the EATCS 64: (1998) |
| 39 | | Alexandru Mateescu:
Words on Trajectories.
Bulletin of the EATCS 65: 118-135 (1998) |
| 38 | | Alexandru Mateescu,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Simple Splicing Systems.
Discrete Applied Mathematics 84(1-3): 145-163 (1998) |
| 37 | | Manfred Kudlek,
Alexandru Mateescu:
Algebraic, Linear and Rational Languages Defined by Mix Operation.
Fundam. Inform. 33(3): 249-264 (1998) |
| 36 | | Alexandru Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Shuffle on Trajectories: Syntactic Constraints.
Theor. Comput. Sci. 197(1-2): 1-56 (1998) |
| 1997 |
|---|
| 35 | | Alexandru Mateescu,
Kai Salomaa,
Sheng Yu:
Decidability of fairness for context-free languages.
Developments in Language Theory 1997: 351-364 |
| 34 | | Alexandru Mateescu,
George Daniel Mateescu:
Infinite trajectories.
Developments in Language Theory 1997: 489-505 |
| 33 | | Manfred Kudlek,
Solomon Marcus,
Alexandru Mateescu:
Contextual Grammars with Distributed Catenation and Shuffle.
FCT 1997: 269-280 |
| 32 | | Alexandru Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Syntactic and Semantic Aspects of Parallelism.
Foundations of Computer Science: Potential - Theory - Cognition 1997: 79-105 |
| 31 | | Alexandru Mateescu,
George Daniel Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Shuffle-like Operations on omega-words.
New Trends in Formal Languages 1997: 395-411 |
| 30 | | Manfred Kudlek,
Alexandru Mateescu:
On Mix Operation.
New Trends in Formal Languages 1997: 430-439 |
| 29 | | Alexandru Mateescu,
George Daniel Mateescu:
Associative Shuffle of Infinite Words.
Structures in Logic and Computer Science 1997: 291-307 |
| 28 | | Alexandru Mateescu:
CD Grammar Systems and Trajectories.
Acta Cybern. 13(2): 141-158 (1997) |
| 27 | | Alexandru Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Geometric Transformations on Language Families: The Power of Symmetry.
Int. J. Found. Comput. Sci. 8(1): 1- (1997) |
| 26 | | Manfred Kudlek,
Alexandru Mateescu:
On Distributed Catenation.
Theor. Comput. Sci. 180(1-2): 341-352 (1997) |
| 1996 |
|---|
| 25 | | 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) |
| 24 | | Alexandru Mateescu,
Arto Salomaa:
Views on Linguistics.
Bulletin of the EATCS 58: (1996) |
| 23 | | Jonathan S. Golan,
Alexandru Mateescu,
Dragos Vaida:
Semirings and Parallel Composition of Processes.
Journal of Automata, Languages and Combinatorics 1(3): 199-218 (1996) |
| 22 | | Tero Harju,
Marjo Lipponen,
Alexandru Mateescu:
Flatwords and Post Correspondence Problem.
Theor. Comput. Sci. 161(1&2): 93-108 (1996) |
| 1995 |
|---|
| 21 | | Manfred Kudlek,
Alexandru Mateescu:
Rational and Algebraic Languages with Distributed Catenation.
Developments in Language Theory 1995: 129-138 |
| 20 | | Manfred Kudlek,
Alexandru Mateescu:
Distributed Catenation and Chomsky Hierarchy.
FCT 1995: 313-322 |
| 19 | | Lila Kari,
Alexandru Mateescu,
Gheorghe Paun,
Arto Salomaa:
On Parallel Deletions Applied to a Word.
ITA 29(2): 129-144 (1995) |
| 18 | | Alexandru Mateescu,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
P, NP and the Post Correspondence Problem
Inf. Comput. 121(2): 135-142 (1995) |
| 17 | | Alexandru Mateescu,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Parikh Prime Words and GO-like Territories.
J. UCS 1(12): 790-810 (1995) |
| 16 | | Alexandru Mateescu,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.
J. UCS 1(5): 292-311 (1995) |
| 15 | | Lila Kari,
Alexandru Mateescu,
Gheorghe Paun,
Arto Salomaa:
Multi-Pattern Languages.
Theor. Comput. Sci. 141(1&2): 253-268 (1995) |
| 1994 |
|---|
| 14 | | Alexandru Mateescu:
On (Left) Partial Shuffle.
Results and Trends in Theoretical Computer Science 1994: 264-278 |
| 13 | | Alexandru Mateescu,
Arto Salomaa:
Nondeterminism in Patterns.
STACS 1994: 661-668 |
| 12 | | Alexandru Mateescu,
Arto Salomaa:
Finite Degrees of Ambiguity in Pattern Languages.
ITA 28(3-4): 233-253 (1994) |
| 11 | | Alexandru Mateescu:
Scattered Deletion and Commutativity.
Theor. Comput. Sci. 125(2): 361-371 (1994) |
| 1993 |
|---|
| 10 | | Alexandru Mateescu:
On Scattered Syntactic Monoids.
FCT 1993: 386-395 |
| 9 | | Alexandru Mateescu,
Arto Salomaa:
Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes.
MFCS 1993: 174-184 |
| 8 | | Alexandru Mateescu,
Arto Salomaa:
On Simplest Possible Solutions for Post Correspondence Problems.
Acta Inf. 30(5): 441-457 (1993) |
| 7 | | Alexandru Mateescu:
The Splendour of an Old Ballad: Aad van Wijngaarden Grammars.
Bulletin of the EATCS 49: 130-142 (1993) |
| 6 | | Lila Kari,
Alexandru Mateescu,
Arto Salomaa,
Gheorghe Paun:
Deletion Sets.
Fundam. Inform. 19(3/4): 355-370 (1993) |
| 5 | | Alexandru Mateescu,
Arto Salomaa:
PCP-Prime Words and Primality Types.
ITA 27(1): 57-70 (1993) |
| 4 | | Lila Kari,
Alexandru Mateescu,
Arto Salomaa,
Gheorghe Paun:
Gramars with Oracles.
Sci. Ann. Cuza Univ. 2: 3-12 (1993) |
| 1992 |
|---|
| 3 | | 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 |
|---|
| 2 | | Alexandru Mateescu:
Special Families of Matrix Languages and Decidable Problems.
Acta Cybern. 10(1-2): 45-52 (1991) |
| 1989 |
|---|
| 1 | | Alexandru Mateescu,
Gheorghe Paun:
On fully initial grammars with regulated rewriting.
Acta Cybern. 9(2): 157-165 (1989) |
