Login / Signup
Syntactic complexity of bifix-free regular languages.
Marek Szykula
John Wittnebel
Published in:
Theor. Comput. Sci. (2019)
Keyphrases
</>
regular languages
decision problems
context free languages
context free grammars
grammatical inference
regular expressions
natural language
computational complexity
worst case
reinforcement learning
active learning
semi supervised
pattern matching
utility function
inductive inference
context free