On binary ⊕-NFAs and succinct descriptions of regular languages

Lynette van Zijl. On binary ⊕-NFAs and succinct descriptions of regular languages. Theoretical Computer Science, 328(1-2):161-170, 2004. [doi]

Abstract

Abstract is missing.