Language Decompositions, Primality, and Trajectory-Based Operations

DOI10.1007/978-3-540-70844-5_2zbMath1172.68527OpenAlexW1526241488MaRDI QIDQ3602796

Kai Salomaa

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deletion along trajectories
• On the existence of prime decompositions
• State complexity of unique rational operations
• Shuffle on trajectories: Syntactic constraints
• Aspects of shuffle and deletion on trajectories
• Thin and slender languages
• Decidability of trajectory-based equations
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Length Codes, Products of Languages and Primality
• ON LANGUAGES FACTORIZING THE FREE MONOID
• The finest homophonic partition and related code concepts
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
• Developments in Language Theory

This page was built for publication: Language Decompositions, Primality, and Trajectory-Based Operations