RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS

DOI10.1142/S0129054105003364MaRDI QIDQ5704372zbMATH OpenFDO

Authors 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)

Recommendations

• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• scientific article; zbMATH DE number 2087222
• Shuffle decomposition of regular languages
• scientific article; zbMATH DE number 992018
• scientific article; zbMATH DE number 1860697

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Aspects of shuffle and deletion on trajectories
• Deletion along trajectories
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Shuffle on trajectories: Syntactic constraints
• Thin and slender languages
• Turing machines with restricted memory access

Cited in

(8)

• Shuffle on trajectories: Syntactic constraints
• Shuffle decomposition of regular languages
• On language decompositions and primality
• Orthogonal shuffle on trajectories
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Decidability of trajectory-based equations
• scientific article; zbMATH DE number 2087222 (Why is no real title available?)
• Language Decompositions, Primality, and Trajectory-Based Operations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704372)