State complexity of unary SV-XNFA with different acceptance conditions

DOI10.1007/978-3-319-60252-3_20zbMath1489.68129OpenAlexW2620768494MaRDI QIDQ2401008

Lynette van Zijl, Laurette Marais

Publication date: 31 August 2017

Full work available at URL: https://hal.inria.fr/hal-01657002/file/440206_1_En_20_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata ⋮ Unnamed Item

This page was built for publication: State complexity of unary SV-XNFA with different acceptance conditions