RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
From MaRDI portal
Publication:5704372
DOI10.1142/S0129054105003364zbMath1080.68053MaRDI QIDQ5704372
Kai Salomaa, Michael Domaratzki
Publication date: 14 November 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Decidability of trajectory-based equations, On Language Decompositions and Primality, ORTHOGONAL SHUFFLE ON TRAJECTORIES, Language Decompositions, Primality, and Trajectory-Based Operations
Cites Work
- Unnamed Item
- Deletion along trajectories
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Shuffle on trajectories: Syntactic constraints
- Aspects of shuffle and deletion on trajectories
- Thin and slender languages
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
- Turing machines with restricted memory access