| Publication | Date of Publication | Type |
|---|
| On polynomial recursive sequences | 2026-03-18 | Paper |
| Decidability of bisimulation equivalence for equational graphs of finite out-degree | 2025-10-29 | Paper |
On polynomial recursive sequences
Theory of Computing Systems | 2024-10-07 | Paper |
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
On the termination problem for one-rule semi-Thue system
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Regular matching problems for infinite trees
(available as arXiv preprint) | 2022-02-09 | Paper |
| Regular matching problems for infinite trees | 2022-02-09 | Paper |
The isomorphism problem for finite extensions of free groups is in PSPACE
(available as arXiv preprint) | 2021-07-28 | Paper |
An effective version of Stallings' theorem in the case of context-free groups
Automata, Languages and Programming | 2019-03-29 | Paper |
The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed
Lecture Notes in Computer Science | 2019-01-10 | Paper |
The equivalence problem for deterministic pushdown automata is decidable
Automata, Languages and Programming | 2018-07-04 | Paper |
Equations over free inverse monoids with idempotent variables
Theory of Computing Systems | 2017-10-20 | Paper |
Equations over free inverse monoids with idempotent variables
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Bottom-up rewriting for words and terms
Journal of Symbolic Computation | 2014-09-11 | Paper |
Word-mappings of level 2
Theory of Computing Systems | 2014-03-25 | Paper |
LALBLC A Program Testing the Equivalence of dpda’s
Implementation and Application of Automata | 2013-08-07 | Paper |
| Termination of linear bounded term rewriting systems | 2012-04-25 | Paper |
Tree Automata and Automata on Linear Orderings
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Tree Automata and Automata on Linear Orderings
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Sequences of Level 1, 2, 3,..., k,...
Computer Science – Theory and Applications | 2008-06-03 | Paper |
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
International Journal of Algebra and Computation | 2008-05-20 | Paper |
EQUATIONS IN FREE INVERSE MONOIDS
International Journal of Algebra and Computation | 2008-05-14 | Paper |
Bottom-Up Rewriting Is Inverse Recognizability Preserving
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Theories of HNN-Extensions and Amalgamated Products
Automata, Languages and Programming | 2007-09-11 | Paper |
When Is a Graph Product of Groups Virtually-Free?
Communications in Algebra | 2007-03-30 | Paper |
Iterated pushdown automata and sequences of rational numbers
Annals of Pure and Applied Logic | 2006-08-16 | Paper |
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
SIAM Journal on Computing | 2005-09-16 | Paper |
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2102749 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2086608 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2051168 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2038732 (Why is no real title available?) | 2004-02-08 | Paper |
\(L(A)=L(B)\)? A simplified decidability proof.
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1738657 (Why is no real title available?) | 2002-05-07 | Paper |
\(L(A)=L(B)\)? decidability results from complete formal systems
Theoretical Computer Science | 2000-12-12 | Paper |
Complete formal systems for equivalence problems
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1405670 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1222568 (Why is no real title available?) | 1999-05-31 | Paper |
| scientific article; zbMATH DE number 1232245 (Why is no real title available?) | 1999-01-03 | Paper |
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Theoretical Computer Science | 1998-08-13 | Paper |
The obstructions of a minor-closed set of graphs defined by a context-free grammar
Discrete Mathematics | 1998-02-25 | Paper |
Some undecidable termination problems for semi-Thue systems
Theoretical Computer Science | 1997-02-28 | Paper |
On the rational subsets of the free group
Acta Informatica | 1996-10-27 | Paper |
| scientific article; zbMATH DE number 848090 (Why is no real title available?) | 1996-03-19 | Paper |
Some decision problems about controlled rewriting systems
Theoretical Computer Science | 1990-01-01 | Paper |
A characterisation of deterministic context-free languages by means of right-congruences
Theoretical Computer Science | 1990-01-01 | Paper |
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
Information and Computation | 1989-01-01 | Paper |
Groups and NTS languages
Journal of Computer and System Sciences | 1987-01-01 | Paper |
The equivalence and inclusion problems for NTS languages
Journal of Computer and System Sciences | 1985-01-01 | Paper |
NTS languages are deterministic and congruential
Journal of Computer and System Sciences | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3872710 (Why is no real title available?) | 1984-01-01 | Paper |
Remarques sur les langages de parenthèses
Theoretical Computer Science | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3788014 (Why is no real title available?) | 1982-01-01 | Paper |
A new class of C.F.L. for which the equivalence is decidable
Information Processing Letters | 1981-01-01 | Paper |
