Alexandru Mateescu

According to our database1, Alexandru Mateescu
  • authored at least 67 papers between 1989 and 2006.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2006
Routes and Products of Monoids.
Fundam. Inform., 2006

On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra.
Fundam. Inform., 2006

2004
Subword histories and Parikh matrices.
J. Comput. Syst. Sci., 2004

Matrix Indicators For Subword Occurrences And Ambiguity.
Int. J. Found. Comput. Sci., 2004

Algebraic Aspects of Parikh Matrices.
Proceedings of the Theory Is Forever, 2004

2002
Parallel Finite Automata Systems Communicating by States.
Int. J. Found. Comput. Sci., 2002

On the Injectivity of the Parikh Matrix Mapping.
Fundam. Inform., 2002

Factorizations of Languages and Commutativity Conditions.
Acta Cybern., 2002

Nondeterministic Trajectories.
Proceedings of the Formal and Natural Computing, 2002

2001
Codifiable Languages and the Parikh Matrix Mapping.
J. UCS, 2001

A sharpening of the Parikh mapping.
ITA, 2001

Sewing contexts and mildly context-sensitive languages.
Proceedings of the Where Mathematics, 2001

Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring.
Current Trends in Theoretical Computer Science, 2001

Words on Trajectories.
Current Trends in Theoretical Computer Science, 2001

2000
On Fairness of Many-Dimensional Trajectories.
Journal of Automata, Languages and Combinatorics, 2000

Special Families of Sewing Languages.
Journal of Automata, Languages and Combinatorics, 2000

Contextual Generalized Sequential Machines.
Bulletin of the EATCS, 2000

Routes and Trajectories.
Proceedings of the International Colloquium on Words, 2000

On Slender Context-Free Languages.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
J.UCS Special Issue on Formal Languages and Automata.
J. UCS, 1999

Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring.
Bulletin of the EATCS, 1999

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

Contextual grammars with trajectories.
Proceedings of the Developments in Language Theory, 1999

Fair and Associative Infinite Trajectories.
Proceedings of the Jewels are Forever, 1999

1998
Shuffle on Trajectories: Syntactic Constraints.
Theor. Comput. Sci., 1998

Algebraic, Linear and Rational Languages Defined by Mix Operation.
Fundam. Inform., 1998

Words on Trajectories.
Bulletin of the EATCS, 1998

Hybrid Grammars: The Chomsky-Marcus Case.
Bulletin of the EATCS, 1998

Simple Splicing Systems.
Discrete Applied Mathematics, 1998

Shuffle of omega-Words: Algebraic Aspects (Extended Abstract).
Proceedings of the STACS 98, 1998

Shuffle on Trajectories: The Schützenberger Product and Related Operations.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
On Distributed Catenation.
Theor. Comput. Sci., 1997

Geometric Transformations on Language Families: The Power of Symmetry.
Int. J. Found. Comput. Sci., 1997

CD Grammar Systems and Trajectories.
Acta Cybern., 1997

Contextual Grammars with Distributed Catenation and Shuffle.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Decidability of fairness for context-free languages.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

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

Syntactic and Semantic Aspects of Parallelism.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

Shuffle-like Operations on omega-words.
Proceedings of the New Trends in Formal Languages, 1997

Associative Shuffle of Infinite Words.
Proceedings of the Structures in Logic and Computer Science, 1997

On Mix Operation.
Proceedings of the New Trends in Formal Languages, 1997

1996
Flatwords and Post Correspondence Problem.
Theor. Comput. Sci., 1996

Semirings and Parallel Composition of Processes.
Journal of Automata, Languages and Combinatorics, 1996

Views on Linguistics.
Bulletin of the EATCS, 1996

On Representing RE Languages by One-Sided Internal Contextual Languages.
Acta Cybern., 1996

1995
P, NP and the Post Correspondence Problem
Inf. Comput., September, 1995

Multi-Pattern Languages.
Theor. Comput. Sci., 1995

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.
J. UCS, 1995

Parikh Prime Words and GO-like Territories.
J. UCS, 1995

Teams in cooperating grammar systems.
J. Exp. Theor. Artif. Intell., 1995

On Parallel Deletions Applied to a Word.
ITA, 1995

Distributed Catenation and Chomsky Hierarchy.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Rational and Algebraic Languages with Distributed Catenation.
Proceedings of the Developments in Language Theory II, 1995

1994
Scattered Deletion and Commutativity.
Theor. Comput. Sci., 1994

Finite Degrees of Ambiguity in Pattern Languages.
ITA, 1994

Nondeterminism in Patterns.
Proceedings of the STACS 94, 1994

On (Left) Partial Shuffle.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
PCP-Prime Words and Primality Types.
ITA, 1993

Deletion Sets.
Fundam. Inform., 1993

The Splendour of an Old Ballad: Aad van Wijngaarden Grammars.
Bulletin of the EATCS, 1993

Gramars with Oracles.
Sci. Ann. Cuza Univ., 1993

On Simplest Possible Solutions for Post Correspondence Problems.
Acta Inf., 1993

Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On Scattered Syntactic Monoids.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure.
Acta Cybern., 1992

1991
Special Families of Matrix Languages and Decidable Problems.
Acta Cybern., 1991

1989
On fully initial grammars with regulated rewriting.
Acta Cybern., 1989


  Loading...