On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages

DOI10.1016/j.tcs.2004.07.012zbMath1071.68057OpenAlexW1972814610MaRDI QIDQ703507

Lynette van Zijl

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.012

zbMATH Keywords

AutomataNondeterminismSuccinctness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata ⋮ Complexity of exclusive nondeterministic finite automata ⋮ MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS ⋮ Formal languages over GF(2) ⋮ Compact Normal Form for Regular Languages as Xor Automata

Cites Work

• Finite automata and unary languages
• Succinct representation of regular languages by Boolean automata
• Succinct Descriptions of Regular Languages with Binary ⊕-NFAs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages