The state complexity of language operations on XNFA-succinct unary regular languages.

Laurette Marais Lynette van Zijl

Published in: SAICSIT (2018)

Keyphrases

regular languages
decision problems
context free languages
grammatical inference
regular expressions
finite state machines
finite automata
context free grammars
computational complexity
state space
upper bound
pattern matching
data exchange
language learning
pac learning
positive data