scientific article; zbMATH DE number 2068876
From MaRDI portal
Publication:4465337
zbMATH Open1094.68576MaRDI QIDQ4465337FDOQ4465337
Authors: Juraj Hromkovič 
Publication date: 27 May 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (25)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- State complexity of cyclic shift
- 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
- More on deterministic and nondeterministic finite cover automata
- STACS 2004
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity
- Descriptional complexity of finite automata -- selected highlights
- Title not available (Why is that?)
- Nondeterministic complexity in subclasses of convex languages
- Title not available (Why is that?)
- Operational state complexity of nested word automata
- Descriptional Complexity of Operations on Alternating and Boolean Automata
- Title not available (Why is that?)
- Descriptional and computational complexity of finite automata -- a survey
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
