scientific article; zbMATH DE number 1156489
From MaRDI portal
Publication:4390537
zbMath0897.68060MaRDI QIDQ4390537
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Closure properties and descriptional complexity of deterministic regular expressions ⋮ State complexity of permutation on finite languages over a binary alphabet ⋮ State complexity of combined operations ⋮ On the state complexity of reversals of regular languages ⋮ On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages ⋮ More on Deterministic and Nondeterministic Finite Cover Automata ⋮ Nondeterministic operational complexity in subregular languages ⋮ Nondeterministic state complexity of star-free languages ⋮ Incomplete operational transition complexity of regular languages ⋮ On the average state and transition complexity of finite languages ⋮ Succinct description of regular languages by weak restarting automata ⋮ State complexity of finite partial languages ⋮ Determination of finite automata accepting subregular languages ⋮ Estimation of state complexity of combined operations ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ State Complexity of Projected Languages ⋮ Branching Measures and Nearly Acyclic NFAs ⋮ Descriptional Complexity of Bounded Regular Languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Descriptional complexity of regular languages ⋮ State complexity of finite partial languages ⋮ More on deterministic and nondeterministic finite cover automata
This page was built for publication:
