On the State Complexity of Combined Operations
From MaRDI portal
Publication:5757237
DOI10.1007/11812128_3zbMath1160.68431MaRDI QIDQ5757237
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
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal, State complexity of star of union and square of union on \textit{k} regular languages, State complexity of combined operations with two basic operations, Incomplete operational transition complexity of regular languages, Boundary sets of regular and context-free languages, On the Hopcroft's minimization technique for DFA and DFCA, Estimation of state complexity of combined operations, Undecidability of State Complexities Using Mirror Images, Hopcroft’s Minimization Technique: Queues or Stacks?