scientific article; zbMATH DE number 2068876
From MaRDI portal
Publication:4465337
zbMath1094.68576MaRDI QIDQ4465337
Publication date: 27 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
State complexity of cyclic shift ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ On the State Complexity of Complements, Stars, and Reversals of Regular Languages ⋮ Transition complexity of language operations ⋮ Nondeterminism Is Essential in Small 2FAs with Few Reversals ⋮ Lower bounds for the transition complexity of NFAs ⋮ State complexity of some operations on binary regular languages ⋮ On the descriptional complexity of Watson-Crick automata ⋮ Operational state complexity of nested word automata ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ State Complexity of Nested Word Automata ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Deterministic blow-ups of minimal NFA's ⋮ More on deterministic and nondeterministic finite cover automata
This page was built for publication:
