A Family of NFA's Which Need 2n -alpha Deterministic States
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Note on Minimal Finite Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Complementing two-way finite automata
Information and Computation
Magic numbers in the state hierarchy of finite automata
Information and Computation
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the State Complexity of Operations on Two-Way Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
State hierarchy for one-way finite automata
Journal of Automata, Languages and Combinatorics
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Converting Self-verifying Automata into Deterministic Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Determination of finite automata accepting subregular languages
Theoretical Computer Science
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
On NFAs where all states are final, initial, or both
Theoretical Computer Science
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
A technique for proving lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
On the separation between k-party and (k - 1)-party nondeterministic message complexities
DLT'02 Proceedings of the 6th international conference on Developments in language theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On transition minimality of bideterministic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
Better hyper-minimization: not as fast, but fewer errors
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Ambiguity of unary symmetric difference NFAs
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On separating constant from polynomial ambiguity of finite automata
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Pairs of complementary unary languages with “balanced” nondeterministic automata
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State complexity and the monoid of transformations of a finite set
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An alternating hierarchy for finite automata
Theoretical Computer Science
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Descriptional complexity of determinization and complementation for finite automata
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Automata for infinite argumentation structures
Artificial Intelligence
Regular languages of partial words
Information Sciences: an International Journal
| Hi-index | 14.99 |
The bounds on state-set size in the proofs of the equivalence between nondeterministic and deterministic finite automata and between two-way and one-way deterministic finite automata are considered. It is shown that the number of states in the subset machine in the first construction cannot be reduced for certain cases. It is also shown that the number of states in the one-way automation constructed in the second proof may be reduced only slightly.