Weakly and Strongly Irreversible Regular Languages.
Bruno GuillonGiovanna J. LavadoGiovanni PighizziniLuca PrigionieroPublished in: Int. J. Found. Comput. Sci. (2022)
Keyphrases
- regular languages
- context free languages
- regular expressions
- grammatical inference
- finite automata
- decision problems
- pac learning
- context free grammars
- positive data
- pattern matching
- statistical queries
- finite state machines
- context free
- inductive inference
- sample complexity
- equivalence queries
- databases
- probability distribution
- relational databases
- training data
- database systems