Finite automata and unary languages
Theoretical Computer Science
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
Finite-State Language Processing
Finite-State Language Processing
Shift Register Sequences
Nondeterminism and succinctly representable regular languages
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Random Number Generation with +-NFAs
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Nondeterminism and succinctly representable regular languages
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
On binary ⊕-NFAs and succinct descriptions of regular languages
Theoretical Computer Science - Implementation and application of automata
Succinct descriptions of regular languages with binary ⊕-NFAs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Magic numbers for symmetric difference NFAs
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Only a relatively small number of families of regular languages can be represented succinctly by nondeterministic finite state machines. We conduct both experimental and theoretical analyses on selective nondeterministic finite automata, or *-NFAs, and show that this class of nondeterministic automata can be used for the succinct representation of a far larger number of regular languages.