On the State Complexity of Combined Operations

DOI10.1007/11812128_3zbMath1160.68431OpenAlexW1561603101MaRDI QIDQ5757237

Sheng Yu

Publication date: 6 September 2007

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11812128_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Undecidability of State Complexities Using Mirror Images ⋮ State complexity of star of union and square of union on \textit{k} regular languages ⋮ Boundary sets of regular and context-free languages ⋮ State complexity of combined operations with two basic operations ⋮ Incomplete operational transition complexity of regular languages ⋮ Estimation of state complexity of combined operations ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal ⋮ On the Hopcroft's minimization technique for DFA and DFCA

This page was built for publication: On the State Complexity of Combined Operations