Login / Signup
Weakly and Strongly Irreversible Regular Languages.
Giovanna J. Lavado
Giovanni Pighizzini
Luca Prigioniero
Published in:
AFL (2017)
Keyphrases
</>
regular languages
context free languages
regular expressions
grammatical inference
finite automata
decision problems
context free grammars
pac learning
finite state machines
context free
positive data
equivalence queries
databases
special case