State complexity of boundary of prefix-free regular languages

DOI10.1142/S0129054115500392MaRDI QIDQ3455750zbMATH OpenFDO

Authors 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)

Full work available at URL https://doi.org/10.1142/S0129054115500392

zbMATH Keywords

boundary operationfinite-state automataprefix-free regular languagesstate complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Operational state complexity of prefix-free regular languages
• State Complexity of Combined Operations for Prefix-Free Regular Languages
• scientific article; zbMATH DE number 7315105
• The boundary of prefix-free languages
• State complexity of k-union and k-intersection for prefix-free regular languages

Cites work

• Estimation of state complexity of combined operations
• IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
• ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
• On the state complexity of reversals of regular languages
• State complexity of basic operations on suffix-free regular languages
• State complexity of combined operations
• STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
• STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
• The state complexities of some basic operations on regular languages
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION

Cited in

(11)

• On the boundary of regular languages
• Kuratowski algebras generated by prefix-free languages
• Kleene closure and state complexity
• The boundary of prefix-free languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Operational state complexity of prefix-free regular languages
• Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
• On the boundary of regular languages
• Boundary sets of regular and context-free languages
• The boundary operation on some subclasses of convex regular languages
• Boundary sets of regular and context-free languages

This page was built for publication: State complexity of boundary of prefix-free regular languages

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