On fully initial grammars with regulated rewriting. - Alexandru Mateescu; Gheorghe Paun (Acta Cybern., 1989)

Special Families of Matrix Languages and Decidable Problems. - Alexandru Mateescu (Acta Cybern., 1991)

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. - Jürgen Dassow; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (Acta Cybern., 1992)

On Scattered Syntactic Monoids. - Alexandru Mateescu (FCT, 1993)

Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. - Alexandru Mateescu; Arto Salomaa (MFCS, 1993)

On Simplest Possible Solutions for Post Correspondence Problems. - Alexandru Mateescu; Arto Salomaa (Acta Informatica, 1993)

Gramars with Oracles. - Lila Kari; Alexandru Mateescu; Arto Salomaa; Gheorghe Paun (Sci. Ann. Cuza Univ., 1993)

The Splendour of an Old Ballad: Aad van Wijngaarden Grammars. - Alexandru Mateescu (Bull. EATCS, 1993)

Deletion Sets. - Lila Kari; Alexandru Mateescu; Arto Salomaa; Gheorghe Paun (Fundam. Informaticae, 1993)

PCP-Prime Words and Primality Types. - Alexandru Mateescu; Arto Salomaa (RAIRO Theor. Informatics Appl., 1993)

Marcus Contextual Grammars with Shuffled Contexts. - Alexandru Mateescu (Mathematical Aspects of Natural and Formal Languages, 1994)

On (Left) Partial Shuffle. - Alexandru Mateescu (Results and Trends in Theoretical Computer Science, 1994)

Nondeterminism in Patterns. - Alexandru Mateescu; Arto Salomaa (STACS, 1994)

Finite Degrees of Ambiguity in Pattern Languages. - Alexandru Mateescu; Arto Salomaa (RAIRO Theor. Informatics Appl., 1994)

Scattered Deletion and Commutativity. - Alexandru Mateescu (Theor. Comput. Sci., 1994)

Rational and Algebraic Languages with Distributed Catenation. - Manfred Kudlek; Alexandru Mateescu (Developments in Language Theory, 1995)

Distributed Catenation and Chomsky Hierarchy. - Manfred Kudlek; Alexandru Mateescu (FCT, 1995)

On Parallel Deletions Applied to a Word. - Lila Kari; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (RAIRO Theor. Informatics Appl., 1995)

Teams in cooperating grammar systems. - Lila Kari; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (J. Exp. Theor. Artif. Intell., 1995)

Parikh Prime Words and GO-like Territories. - Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (J. Univers. Comput. Sci., 1995)

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 1995)

Multi-Pattern Languages. - Lila Kari; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (Theor. Comput. Sci., 1995)

P, NP and the Post Correspondence Problem - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (Inf. Comput., 1995)

On Representing RE Languages by One-Sided Internal Contextual Languages. - Andrzej Ehrenfeucht; Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Acta Cybern., 1996)

Views on Linguistics. - Alexandru Mateescu; Arto Salomaa (Bull. EATCS, 1996)

Semirings and Parallel Composition of Processes. - Jonathan S. Golan; Alexandru Mateescu; Dragos Vaida (J. Autom. Lang. Comb., 1996)

Flatwords and Post Correspondence Problem. - Tero Harju; Marjo Lipponen; Alexandru Mateescu (Theor. Comput. Sci., 1996)

On Mix Operation. - Manfred Kudlek; Alexandru Mateescu (New Trends in Formal Languages, 1997)

Associative Shuffle of Infinite Words. - Alexandru Mateescu; George Daniel Mateescu (Structures in Logic and Computer Science, 1997)

Shuffle-like Operations on omega-words. - Alexandru Mateescu; George Daniel Mateescu; Grzegorz Rozenberg; Arto Salomaa (New Trends in Formal Languages, 1997)

Syntactic and Semantic Aspects of Parallelism. - Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

Infinite trajectories. - Alexandru Mateescu; George Daniel Mateescu (Developments in Language Theory, 1997)

Decidability of fairness for context-free languages. - Alexandru Mateescu; Kai Salomaa; Sheng Yu 001 (Developments in Language Theory, 1997)

Contextual Grammars with Distributed Catenation and Shuffle. - Manfred Kudlek; Solomon Marcus; Alexandru Mateescu (FCT, 1997)

CD Grammar Systems and Trajectories. - Alexandru Mateescu (Acta Cybern., 1997)

Geometric Transformations on Language Families: The Power of Symmetry. - Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Int. J. Found. Comput. Sci., 1997)

On Distributed Catenation. - Manfred Kudlek; Alexandru Mateescu (Theor. Comput. Sci., 1997)

Formal Languages: an Introduction and a Synopsis. - Alexandru Mateescu; Arto Salomaa (Handbook of Formal Languages (1), 1997)

Aspects of Classical Language Theory. - Alexandru Mateescu; Arto Salomaa (Handbook of Formal Languages (1), 1997)

Shuffle on Trajectories: The Schützenberger Product and Related Operations. - Tero Harju; Alexandru Mateescu; Arto Salomaa (MFCS, 1998)

Shuffle of omega-Words: Algebraic Aspects (Extended Abstract). - Alexandru Mateescu (STACS, 1998)

Simple Splicing Systems. - Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Discret. Appl. Math., 1998)

Hybrid Grammars: The Chomsky-Marcus Case. - Carlos Martín-Vide; Alexandru Mateescu; Gheorghe Paun (Bull. EATCS, 1998)

Words on Trajectories. - Alexandru Mateescu (Bull. EATCS, 1998)

Algebraic, Linear and Rational Languages Defined by Mix Operation. - Manfred Kudlek; Alexandru Mateescu (Fundam. Informaticae, 1998)

Characterizations of re languages starting from internal contextual languages. - Alexandru Mateescu; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (Int. J. Comput. Math., 1998)

Associative closure and periodicity of $ omega $-words. - Alexandru Mateescu; George Daniel Mateescu (RAIRO Theor. Informatics Appl., 1998)

Shuffle on Trajectories: Syntactic Constraints. - Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Theor. Comput. Sci., 1998)

Fair and Associative Infinite Trajectories. - Alexandru Mateescu; George Daniel Mateescu (Jewels are Forever, 1999)

Contextual grammars with trajectories. - Carlos Martín-Vide; Alexandru Mateescu (Developments in Language Theory, 1999)

Sewing Grammars. - Carlos Martín-Vide; Alexandru Mateescu (FCT, 1999)

Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. - Alexandru Mateescu; Arto Salomaa (Bull. EATCS, 1999)

Contexts on trajectories. - Carlos Martín-Vide; Alexandru Mateescu; Grzegorz Rozenberg; Arto Salomaa (Int. J. Comput. Math., 1999)

J.UCS Special Issue on Formal Languages and Automata. - Alexandru Mateescu (J. Univers. Comput. Sci., 1999)

Algebraic Representations of Regular Array Languages. - Rudolf Freund; Alexandru Mateescu; Arto Salomaa (Finite Versus Infinite, 2000)

On Slender Context-Free Languages. - Pál Dömösi; Alexandru Mateescu (Recent Topics in Mathematical and Computational Linguistics, 2000)

Routes and Trajectories. - Alexandru Mateescu (Words, Languages & Combinatorics, 2000)

Contextual Generalized Sequential Machines. - Carlos Martín-Vide; Alexandru Mateescu (Bull. EATCS, 2000)

Special Families of Sewing Languages. - Carlos Martín-Vide; Alexandru Mateescu (J. Autom. Lang. Comb., 2000)

On Fairness of Many-Dimensional Trajectories. - Alexandru Mateescu; Kai Salomaa; Sheng Yu 001 (J. Autom. Lang. Comb., 2000)

Words on Trajectories. - Alexandru Mateescu (Current Trends in Theoretical Computer Science, 2001)

Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring. - Alexandru Mateescu; Arto Salomaa (Current Trends in Theoretical Computer Science, 2001)

Sewing contexts and mildly context-sensitive languages. - Carlos Martín-Vide; Alexandru Mateescu; Arto Salomaa (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

A sharpening of the Parikh mapping. - Alexandru Mateescu; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (RAIRO Theor. Informatics Appl., 2001)

Codifiable Languages and the Parikh Matrix Mapping. - Adrian Atanasiu; Carlos Martín-Vide; Alexandru Mateescu (J. Univers. Comput. Sci., 2001)

Nondeterministic Trajectories. - Alexandru Mateescu; Arto Salomaa (Formal and Natural Computing, 2002)

Factorizations of Languages and Commutativity Conditions. - Alexandru Mateescu; Arto Salomaa; Sheng Yu 001 (Acta Cybern., 2002)

On the Injectivity of the Parikh Matrix Mapping. - Adrian Atanasiu; Carlos Martín-Vide; Alexandru Mateescu (Fundam. Informaticae, 2002)

Parallel Finite Automata Systems Communicating by States. - Carlos Martín-Vide; Alexandru Mateescu; Victor Mitrana (Int. J. Found. Comput. Sci., 2002)

Algebraic Aspects of Parikh Matrices. - Alexandru Mateescu (Theory Is Forever, 2004)

Matrix Indicators For Subword Occurrences And Ambiguity. - Alexandru Mateescu; Arto Salomaa (Int. J. Found. Comput. Sci., 2004)

Subword histories and Parikh matrices. - Alexandru Mateescu; Arto Salomaa; Sheng Yu 001 (J. Comput. Syst. Sci., 2004)

On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra. - Erzsébet Csuhaj-Varjú; Alexandru Mateescu (Fundam. Informaticae, 2006)

Routes and Products of Monoids. - Alexandru Mateescu; Rudolf Freund (Fundam. Informaticae, 2006)