Login / Signup
The pseudopalindromic completion of regular languages.
Szilárd Zsolt Fazekas
Florin Manea
Robert Mercas
Kayoko Shikishima-Tsuji
Published in:
Inf. Comput. (2014)
Keyphrases
</>
regular languages
context free languages
grammatical inference
regular expressions
finite automata
decision problems
context free grammars
pac learning
positive data
statistical queries
context free
finite state machines
pattern matching
uniform distribution
model selection
database
active learning