State complexity of combined operations for suffix-free regular languages

DOI10.1016/j.tcs.2013.09.014zbMath1358.68167OpenAlexW2068984365MaRDI QIDQ392179

Yo-Sub Han, Hae-Sung Eom

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.014

zbMATH Keywords

state complexitycombined operationssuffix-free regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Operational State Complexity of Subtree-Free Regular Tree Languages ⋮ State complexity of deletion and bipolar deletion

Cites Work

• Reversal of binary regular languages
• 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
• State complexity of combined operations
• On the State Complexity of Star of Union and Star of Intersection
• 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
• 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