Login / Signup
Operational State Complexity of Prefix-Free Regular Languages.
Yo-Sub Han
Kai Salomaa
Derick Wood
Published in:
Automata, Formal Languages, and Related Topics (2009)
Keyphrases
</>
regular languages
decision problems
grammatical inference
context free languages
databases
computational complexity
metadata
special case
hidden markov models
state space
pattern matching
regular expressions
finite state machines