Generalized acceptance, succinctness and supernondeterministic finite automata.

DOI10.1016/J.TCS.2003.10.013zbMath1069.68072OpenAlexW2050777932MaRDI QIDQ1426171

Lynette van Zijl

Publication date: 14 March 2004

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

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

zbMATH Keywords

AutomataNondeterminismSuccinctnessAcceptance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• On equations for regular languages, finite automata, and sequential networks
• Succinct representation of regular languages by Boolean automata
• Alternation

This page was built for publication: Generalized acceptance, succinctness and supernondeterministic finite automata.