Cyclic shift on prefix-free languages

DOI10.1007/978-3-642-38536-0_22zbMATH Open1381.68120OpenAlexW25113233MaRDI QIDQ4928490FDOQ4928490

Authors:

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

Recommendations

• State complexity of cyclic shift
• scientific article; zbMATH DE number 7315105
• The boundary of prefix-free languages
• Prefix-free languages: right quotient and reversal
• Operational state complexity of prefix-free regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (8)

• Maximal state complexity and generalized de Bruijn words
• Generalized de Bruijn words and the state complexity of conjugate sets
• Non-regular Maximal Prefix-Free Subsets of Regular Languages
• Kuratowski algebras generated by prefix-free languages
• Prefix-free languages: left and right quotient and reversal
• Star-complement-star on prefix-free languages
• Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
• Cyclic languages and strongly cyclic languages

This page was built for publication: Cyclic shift on prefix-free languages

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