State Complexity of Boundary of Prefix-Free Regular Languages

DOI10.1142/S0129054115500392zbMath1430.68143MaRDI QIDQ3455750

Hae-Sung Eom, Yo-Sub Han

Publication date: 11 December 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

state complexityfinite-state automataprefix-free regular languagesboundary operation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation ⋮ Kuratowski Algebras Generated by Prefix-Free Languages

Cites Work

• On the state complexity of reversals of regular languages
• State complexity of basic operations on suffix-free regular languages
• The state complexities of some basic operations on regular languages
• Estimation of state complexity of combined operations
• 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 UNION AND INTERSECTION OF FINITE LANGUAGES
• STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
• IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES

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