Uniformisation Gives the Full Strength of Regular Languages.

Nathan Lhote Vincent Michielini Michal Skrzypczak

Published in: MFCS (2019)

Keyphrases

regular languages
context free languages
regular expressions
grammatical inference
finite automata
decision problems
pac learning
context free grammars
positive data
context free
pattern matching
finite state machines
inductive inference
learning theory
databases
uniform distribution
learning algorithm