State complexity of power

From MaRDI portal
Publication:1019718

DOI10.1016/J.TCS.2009.02.025zbMath1168.68024OpenAlexW2084661883MaRDI QIDQ1019718

Michael Domaratzki, Alexander Okhotin

Publication date: 4 June 2009

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

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




Related Items (28)

A Study of a Simple Class of Modifiers: Product ModifiersState Complexity of Kleene-Star Operations on TreesOperational State Complexity of Subtree-Free Regular Tree LanguagesCOMPLEXITY IN UNION-FREE REGULAR LANGUAGESSTATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSALState complexity of operations on input-driven pushdown automataState complexity of star of union and square of union on \textit{k} regular languagesSTATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTIONNondeterministic operational complexity in subregular languagesState complexity of union and intersection of star on \(k\) regular languagesUnnamed ItemState complexity of combined operations with two basic operationsState complexity of operations on two-way finite automata over a unary alphabetUnnamed ItemOn the State Complexity of Operations on Two-Way Finite AutomataOn the state complexity of operations on two-way finite automataState complexity of union and intersection of square and reversal on \(k\) regular languagesNondeterministic Finite Automata—Recent Results on the Descriptional and Computational ComplexityState Complexity of Four Combined Operations Composed of Union, Intersection, Star and ReversalState Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary AlphabetState complexity of deletion and bipolar deletionSquare on Deterministic, Alternating, and Boolean Finite AutomataState Complexity of Catenation Combined with Union and IntersectionDescriptional complexity of regular languagesState complexity of unambiguous operations on finite automataUndecidability of state complexityState Complexity of k-Union and k-Intersection for Prefix-Free Regular LanguagesOperations on subregular languages and nondeterministic state complexity




Cites Work




This page was built for publication: State complexity of power