On the decidability of accessibility problems (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Well-structured transition systems everywhere!
Theoretical Computer Science
Sequential grammars and automata with valances
Theoretical Computer Science
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Algorithms in geometric group theory
Algorithms in geometric group theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Regular solutions of language inequalities and well quasi-orders
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Leftist Grammars Are Non-primitive Recursive
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Elements of Automata Theory
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Tilings and Submonoids of Metabelian Groups
Theory of Computing Systems
Theories of HNN-Extensions and amalgamated products
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
| Hi-index | 0.00 |
It is shown that membership in rational subsets of wreath products H≀V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that there exists a fixed finitely generated submonoid in the wreath product ℤ≀ℤ with an undecidable membership problem.