Alexandru Mateescu

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:27/106 · DBLP profile ↗

← Back

27ranked-venue papers

13as first author

0since 2021 · last 2006

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 26 · 13 first-authorArtificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Computational complexity · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Computational complexity › complexity classes P vs NP	0.0	1	1995	P, NP and the Post Correspondence Problem · Inf. Comput. 1995
Computational complexity › decidability post correspondence problem	0.0	1	1995	P, NP and the Post Correspondence Problem · Inf. Comput. 1995

Year	Publication	Venue	Position
2006	On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra Erzsébet Csuhaj-Varjú, Alexandru Mateescu	Fundam. Informaticae	2
2006	Routes and Products of Monoids Alexandru Mateescu, Rudolf Freund	Fundam. Informaticae	1
2004	Subword histories and Parikh matrices Alexandru Mateescu, Arto Salomaa, Sheng Yu 0001	J. Comput. Syst. Sci.	1
2002	On the Injectivity of the Parikh Matrix Mapping Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu	Fundam. Informaticae	3
1999	Contextual grammars with trajectories Carlos Martín-Vide, Alexandru Mateescu	Developments in Language Theory	2
1999	Sewing Grammars Carlos Martín-Vide, Alexandru Mateescu	FCT	2
1998	Shuffle on Trajectories: The Schützenberger Product and Related Operations Tero Harju, Alexandru Mateescu, Arto Salomaa	MFCS	2
1998	Shuffle of omega-Words: Algebraic Aspects (Extended Abstract) Alexandru Mateescu	STACS	1
1998	Simple Splicing Systems Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa	Discret. Appl. Math.	1
1998	Algebraic, Linear and Rational Languages Defined by Mix Operation abstract We consider operations between languages, based on splitting the underlying alphabet into two disjoint sets, one of them having some priority. Such operations are generalizations of the classical catenation or shuffle operation, with which rational, Manfred Kudlek, Alexandru Mateescu	Fundam. Informaticae	2
1998	Shuffle on Trajectories: Syntactic Constraints Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa	Theor. Comput. Sci.	1
1997	Infinite trajectories Alexandru Mateescu, George Daniel Mateescu	Developments in Language Theory	1
1997	Decidability of fairness for context-free languages Alexandru Mateescu, Kai Salomaa, Sheng Yu 0001	Developments in Language Theory	1
1997	Contextual Grammars with Distributed Catenation and Shuffle Manfred Kudlek, Solomon Marcus, Alexandru Mateescu	FCT	3
1997	On Distributed Catenation Manfred Kudlek, Alexandru Mateescu	Theor. Comput. Sci.	2
1996	Flatwords and Post Correspondence Problem Tero Harju, Marjo Lipponen, Alexandru Mateescu	Theor. Comput. Sci.	3
1995	Rational and Algebraic Languages with Distributed Catenation Manfred Kudlek, Alexandru Mateescu	Developments in Language Theory	2
1995	Distributed Catenation and Chomsky Hierarchy Manfred Kudlek, Alexandru Mateescu	FCT	2
1995	P, NP and the Post Correspondence Problem Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu 0001	Inf. Comput.	1
1995	Teams in cooperating grammar systems abstract We consider grammar systems in which several components are active at the same moment (a team of components is working). The power of such mechanisms is investigated and it is found that in many cases the team feature increases the generative capacity of grammar systems. In the so-called t-mode of derivation (a team works as much as it can) it is found that the team size does not induce an infinite hierarchy of languages. However, the family obtained in this case is a full abstract family of languages properly including ETOL. Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa	J. Exp. Theor. Artif. Intell.	2
1995	Multi-Pattern Languages Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa	Theor. Comput. Sci.	2
1994	Nondeterminism in Patterns Alexandru Mateescu, Arto Salomaa	STACS	1
1994	Scattered Deletion and Commutativity Alexandru Mateescu	Theor. Comput. Sci.	1
1993	On Scattered Syntactic Monoids Alexandru Mateescu	FCT	1
1993	Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes Alexandru Mateescu, Arto Salomaa	MFCS	1
1993	On Simplest Possible Solutions for Post Correspondence Problems Alexandru Mateescu, Arto Salomaa	Acta Informatica	1
1993	Deletion Sets Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun	Fundam. Informaticae	2