On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata.

Damian Niwinski

Published in: MFCS (1991)

Keyphrases

finite automata
tree automata
regular languages
regular expressions
grammatical inference
deterministic automata
probabilistic automata
symmetric difference
finite automaton
decision trees
knowledge representation
machine learning
object oriented
structured data