scientific article; zbMATH DE number 1834665
From MaRDI portal
Publication:4779161
zbMath0999.68104MaRDI QIDQ4779161
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360421
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A family of NFAs which need 2\(^{n}-\alpha\) deterministic states ⋮ Concatenation of regular languages and descriptional complexity ⋮ On a structural property in the state complexity of projected regular languages ⋮ On the State Complexity of Complements, Stars, and Reversals of Regular Languages ⋮ Magic numbers in the state hierarchy of finite automata ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ State Complexity of Projected Languages ⋮ Magic Numbers and Ternary Alphabet ⋮ Concatenation of Regular Languages and Descriptional Complexity ⋮ Descriptional complexity of regular languages
