On Language Decompositions and Primality
From MaRDI portal
Publication:3003471
DOI10.1007/978-3-642-19391-0_5zbMath1327.68154OpenAlexW193481530MaRDI QIDQ3003471
Kai Salomaa, Michael Domaratzki
Publication date: 27 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19391-0_5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deletion along trajectories
- Maximal and minimal solutions to language equations
- On the existence of prime decompositions
- Decision problems for language equations
- State complexity of unique rational operations
- Variants of codes and indecomposable languages
- Shuffle on trajectories: Syntactic constraints
- On language equations with invertible operations
- Shuffle and scattered deletion closure of languages
- Language equations, maximality and error-detection
- Aspects of shuffle and deletion on trajectories
- Decidability of trajectory-based equations
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
- A Second Course in Formal Languages and Automata Theory
- ON LANGUAGES FACTORIZING THE FREE MONOID
- Minimal NFA Problems are Hard
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- Commutation of Binary Factorial Languages
- Codes conjugués
- LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
- RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
- Developments in Language Theory
