Cyclic Shift on Prefix-Free Languages
From MaRDI portal
Publication:4928490
DOI10.1007/978-3-642-38536-0_22zbMath1381.68120OpenAlexW25113233MaRDI QIDQ4928490
No author found.
Publication date: 14 June 2013
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_22
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Prefix-free languages: left and right quotient and reversal ⋮ Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation ⋮ Non-regular Maximal Prefix-Free Subsets of Regular Languages ⋮ Kuratowski Algebras Generated by Prefix-Free Languages ⋮ Star-Complement-Star on Prefix-Free Languages ⋮ Maximal state complexity and generalized de Bruijn words
This page was built for publication: Cyclic Shift on Prefix-Free Languages
