State complexity of union and intersection of star on \(k\) regular languages

DOI10.1016/j.tcs.2011.12.028zbMath1238.68075OpenAlexW2107552967MaRDI QIDQ418766

Yuan Gao, Lila Kari, Sheng Yu

Publication date: 30 May 2012

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

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

zbMATH Keywords

finite automataregular languagesstate complexitycombined operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

State complexity of star of union and square of union on \textit{k} regular languages ⋮ Kleene closure and state complexity ⋮ Prefix-free languages: left and right quotient and reversal ⋮ IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES

Cites Work

• State complexity of basic language operations combined with reversal
• State complexity of power
• The state complexities of some basic operations on regular languages
• State complexity of some operations on binary regular languages
• Estimation of state complexity of combined operations
• State complexity of combined operations
• On the State Complexity of Star of Union and Star of Intersection
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL
• Undecidability of the State Complexity of Composed Regular Operations
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
• State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal
• STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
• 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 union and intersection of star on \(k\) regular languages