Login / Signup
State Complexity For Prefix, Suffix and Bifix operators on regular languages.
Elena V. Pribavkina
Emanuele Rodaro
Published in:
ICTCS (2009)
Keyphrases
</>
regular languages
decision problems
context free languages
data structure
state space
learning problems
regular expressions
computational complexity
theoretical analysis
grammatical inference
lower bound
special case
query language
finite state machines
finite automata