Login / Signup
Non-regular Maximal Prefix-Free Subsets of Regular Languages.
Jozef Jirásek Jr.
Published in:
DLT (2016)
Keyphrases
</>
regular languages
regular expressions
grammatical inference
context free languages
finite automata
decision problems
context free grammars
pac learning
positive data
context free
finite state machines
pattern matching
statistical queries
matching algorithm
knowledge based systems