Finite automata and unary languages
Theoretical Computer Science
Introduction to the Theory of Computation
Introduction to the Theory of Computation
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
On the number of distinct languages accepted by finite automata with n states
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
On binary ⊕-NFAs and succinct descriptions of regular languages
Theoretical Computer Science - Implementation and application of automata
| Hi-index | 0.00 |
Champarnaud [1] analyzed the number of states obtained from a binary ⊕-NFA during the subset construction. We extend this work to an experimental analysis of the size of the minimal DFAs obtained from binary ⊕-NFAs.We then consider the number of distinct languages accepted by binary ⊕-NFAs, and compare that to Domaratzki's results [2] for (traditional) binary NFAs. We also show that there are certain regular languages which are accepted by succinct ⊕-NFAs, but for which no succinct traditional NFA exists.