Alexandru Mateescu

Rudolf Freund

Fundam. Informaticae, 2006

On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

Fundam. Informaticae, 2006

2004

Subword histories and Parikh matrices.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Matrix Indicators For Subword Occurrences And Ambiguity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

Algebraic Aspects of Parikh Matrices.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2002

Parallel Finite Automata Systems Communicating by States.

[BibT_eX]

[DOI]

Victor Mitrana

Int. J. Found. Comput. Sci., 2002

On the Injectivity of the Parikh Matrix Mapping.

[BibT_eX]

[DOI]

Adrian Atanasiu

Fundam. Informaticae, 2002

Factorizations of Languages and Commutativity Conditions.

[BibT_eX]

[DOI]

Acta Cybern., 2002

Nondeterministic Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Formal and Natural Computing, 2002

2001

Codifiable Languages and the Parikh Matrix Mapping.

[BibT_eX]

[DOI]

Adrian Atanasiu

J. Univers. Comput. Sci., 2001

A sharpening of the Parikh mapping.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2001

Sewing contexts and mildly context-sensitive languages.

[BibT_eX]

Proceedings of the Where Mathematics, 2001

Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Words on Trajectories.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

On Fairness of Many-Dimensional Trajectories.

[BibT_eX]

[DOI]

Kai Salomaa

J. Autom. Lang. Comb., 2000

Special Families of Sewing Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

Contextual Generalized Sequential Machines.

[BibT_eX]

Bull. EATCS, 2000

Routes and Trajectories.

[BibT_eX]

Proceedings of the International Colloquium on Words, 2000

On Slender Context-Free Languages.

[BibT_eX]

Pál Dömösi

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

Algebraic Representations of Regular Array Languages.

[BibT_eX]

[DOI]

Rudolf Freund

Proceedings of the Finite Versus Infinite, 2000

1999

J.UCS Special Issue on Formal Languages and Automata.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

Contexts on trajectories.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1999

Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring.

[BibT_eX]

Bull. EATCS, 1999

Sewing Grammars.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Contextual grammars with trajectories.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

Fair and Associative Infinite Trajectories.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Shuffle on Trajectories: Syntactic Constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Associative closure and periodicity of $\omega $-words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1998

Characterizations of re languages starting from internal contextual languages.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1998

Algebraic, Linear and Rational Languages Defined by Mix Operation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

Words on Trajectories.

[BibT_eX]

Bull. EATCS, 1998

Hybrid Grammars: The Chomsky-Marcus Case.

[BibT_eX]

Gheorghe Paun

Bull. EATCS, 1998

Simple Splicing Systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Shuffle of omega-Words: Algebraic Aspects (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

Shuffle on Trajectories: The Schützenberger Product and Related Operations.

[BibT_eX]

[DOI]

Tero Harju

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Aspects of Classical Language Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Formal Languages: an Introduction and a Synopsis.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

On Distributed Catenation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Geometric Transformations on Language Families: The Power of Symmetry.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1997

CD Grammar Systems and Trajectories.

[BibT_eX]

[DOI]

Acta Cybern., 1997

Contextual Grammars with Distributed Catenation and Shuffle.

[BibT_eX]

[DOI]

Solomon Marcus

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Decidability of fairness for context-free languages.

[BibT_eX]

Kai Salomaa

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Infinite trajectories.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Syntactic and Semantic Aspects of Parallelism.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

Shuffle-like Operations on omega-words.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

Associative Shuffle of Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Structures in Logic and Computer Science, 1997

On Mix Operation.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

1996

Flatwords and Post Correspondence Problem.

[BibT_eX]

[DOI]

Tero Harju

Marjo Lipponen

Theor. Comput. Sci., 1996

Semirings and Parallel Composition of Processes.

[BibT_eX]

[DOI]

Jonathan S. Golan

Dragos Vaida

J. Autom. Lang. Comb., 1996

Views on Linguistics.

[BibT_eX]

Bull. EATCS, 1996

On Representing RE Languages by One-Sided Internal Contextual Languages.

[BibT_eX]

[DOI]

Acta Cybern., 1996

1995

P, NP and the Post Correspondence Problem

[BibT_eX]

[DOI]

Inf. Comput., September, 1995

Multi-Pattern Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Parikh Prime Words and GO-like Territories.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Teams in cooperating grammar systems.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1995

On Parallel Deletions Applied to a Word.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Distributed Catenation and Chomsky Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Rational and Algebraic Languages with Distributed Catenation.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

Scattered Deletion and Commutativity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Finite Degrees of Ambiguity in Pattern Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

Nondeterminism in Patterns.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

On (Left) Partial Shuffle.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Marcus Contextual Grammars with Shuffled Contexts.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993

PCP-Prime Words and Primality Types.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

Deletion Sets.

[BibT_eX]

Fundam. Informaticae, 1993

The Splendour of an Old Ballad: Aad van Wijngaarden Grammars.

[BibT_eX]

Bull. EATCS, 1993

Gramars with Oracles.

[BibT_eX]

Sci. Ann. Cuza Univ., 1993

On Simplest Possible Solutions for Post Correspondence Problems.

[BibT_eX]

[DOI]

Acta Informatica, 1993

Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On Scattered Syntactic Monoids.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure.

[BibT_eX]

[DOI]

Acta Cybern., 1992

1991

Special Families of Matrix Languages and Decidable Problems.

[BibT_eX]

[DOI]

Acta Cybern., 1991

1989

On fully initial grammars with regulated rewriting.

[BibT_eX]

[DOI]