Language Decompositions, Primality, and Trajectory-Based Operations

DOI10.1007/978-3-540-70844-5_2MaRDI QIDQ3602796zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 2162119 (Why is no real title available?)
• scientific article; zbMATH DE number 4121467 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Aspects of shuffle and deletion on trajectories
• Decidability of trajectory-based equations
• Deletion along trajectories
• Developments in Language Theory
• Interpreted trajectories
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
• Length Codes, Products of Languages and Primality
• ON LANGUAGES FACTORIZING THE FREE MONOID
• On the decomposition of finite languages
• On the existence of prime decompositions
• RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Shuffle decomposition of regular languages
• Shuffle on trajectories: Syntactic constraints
• State complexity of unique rational operations
• The finest homophonic partition and related code concepts
• Thin and slender languages

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

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