RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS

DOI10.1142/S0129054105003364zbMath1080.68053MaRDI QIDQ5704372

Michael Domaratzki, Kai Salomaa

Publication date: 14 November 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

unary regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

On Language Decompositions and Primality ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ ORTHOGONAL SHUFFLE ON TRAJECTORIES ⋮ Decidability of trajectory-based equations

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

This page was built for publication: RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS