scientific article; zbMATH DE number 2068876
From MaRDI portal
Publication:4465337
Recommendations
Cited in
(25)- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- State complexity of cyclic shift
- Transition complexity of language operations
- Lower bounds for the transition complexity of NFAs
- Nondeterminism is essential in small 2FAs with few reversals
- State complexity of some operations on binary regular languages
- More on deterministic and nondeterministic finite cover automata
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity
- STACS 2004
- Descriptional complexity of finite automata -- selected highlights
- scientific article; zbMATH DE number 2125663 (Why is no real title available?)
- Nondeterministic complexity in subclasses of convex languages
- Operational state complexity of nested word automata
- scientific article; zbMATH DE number 1512078 (Why is no real title available?)
- Descriptional Complexity of Operations on Alternating and Boolean Automata
- scientific article; zbMATH DE number 7444008 (Why is no real title available?)
- Descriptional and computational complexity of finite automata -- a survey
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- scientific article; zbMATH DE number 5309918 (Why is no real title available?)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Deterministic blow-ups of minimal NFA's
- On the descriptional complexity of Watson-Crick automata
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- State Complexity of Nested Word Automata
- scientific article; zbMATH DE number 4026835 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4465337)
