Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets.

Mikolaj Bojanczyk Thomas Place

Published in: ICALP (2) (2012)

Keyphrases

regular languages
regular expressions
grammatical inference
context free languages
finite automata
decision problems
pac learning
positive data
context free grammars
finite state machines
decision trees
training data
learning theory
database systems
pattern matching