Login / Signup
Computability by Finite Automata and Pisot Bases.
Daniel Berend
Christiane Frougny
Published in:
Math. Syst. Theory (1994)
Keyphrases
</>
finite automata
deterministic automata
grammatical inference
probabilistic automata
regular expressions
tree automata
regular languages
finite automaton
artificial intelligence
hidden markov models
information extraction