State Complexity of Combined Operations for Prefix-Free Regular Languages

DOI10.1007/978-3-642-00982-2_34zbMath1234.68210OpenAlexW1596937309MaRDI QIDQ3618598

Kai Salomaa, Yo-Sub Han, Sheng Yu

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_34

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Prefix-free languages: left and right quotient and reversal ⋮ Non-regular Maximal Prefix-Free Subsets of Regular Languages

Cites Work

• On the state complexity of reversals of regular languages
• The state complexity of \(L^{2}\) and \(L^k\)
• Succinct representation of regular languages by Boolean automata
• The state complexities of some basic operations on regular languages
• State complexity of combined operations
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
• State Complexity of Basic Operations on Suffix-Free Regular Languages
• STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
• Implementation and Application of Automata
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: State Complexity of Combined Operations for Prefix-Free Regular Languages