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
Succinct descriptions of regular languages with binary ⊕-NFAs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Compact Normal Form for Regular Languages as Xor Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Language equations with symmetric difference
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Minimal DFA for symmetric difference NFA
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
We prove a new lower bound for the number of distinct languages accepted by binary symmetric difference automata (⊕-NFAs), and compare that to Domaratzki's results (J. Automata Languages Combin. 7(4) (2002) 469) for (traditional) binary nondeterministic finite automata (NFAs). We also show that there are certain regular languages which are accepted by succinct ⊕-NFAs, but for which no succinct traditional NFA exists.