Login / Signup
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages.
Lukas Fleischer
Jeffrey O. Shallit
Published in:
Int. J. Found. Comput. Sci. (2021)
Keyphrases
</>
regular languages
context free languages
grammatical inference
regular expressions
finite automata
n gram
positive data
decision problems
context free grammars
pac learning
context free
database
upper bound
language model
model checking
inductive inference