scientific article
From MaRDI portal
Publication:2754144
zbMath0973.68114MaRDI QIDQ2754144
Hartmut Klauck, Juhani Karhumäki, Sebastian Seibert, Juraj Hromkovič, Georg Schnitger
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata, Operational state complexity of unary NFAs with finite nondeterminism, Left is Better Than Right for Reducing Nondeterminism of NFAs, The tractability frontier for NFA minimization, A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata, On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's, Communication complexity method for measuring nondeterminism in finite automata
