scientific article; zbMATH DE number 1962776

zbMath1033.68063MaRDI QIDQ4418610

Martin Kutrib, Markus Holzer

Publication date: 11 August 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2608/26080148.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (17)

State complexity of combined operations ⋮ Operational complexity and pumping lemmas ⋮ State complexity of star of union and square of union on \textit{k} regular languages ⋮ Further Remarks on the Operational Nonterminal Complexity ⋮ State complexity of union and intersection of star on \(k\) regular languages ⋮ State complexity of combined operations with two basic operations ⋮ Finite transducers and nondeterministic state complexity of regular languages ⋮ Incomplete operational transition complexity of regular languages ⋮ On the average state and transition complexity of finite languages ⋮ On the descriptional complexity of finite automata with modified acceptance conditions ⋮ State complexity of some operations on binary regular languages ⋮ State complexity of union and intersection of square and reversal on \(k\) regular languages ⋮ State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal ⋮ Descriptional and Computational Complexity of Finite Automata ⋮ Operational complexity and right linear grammars ⋮ State Complexity of Catenation Combined with Union and Intersection ⋮ The State Complexity of Permutations on Finite Languages over Binary Alphabets

This page was built for publication: