• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Comparing Verboseness for Finite Automata and Turing Machines.

Till Tantau
Published in: STACS (2002)
Keyphrases
  • finite automata
  • turing machine
  • probabilistic automata
  • grammatical inference
  • regular expressions
  • deterministic automata
  • tree automata
  • regular languages
  • finite automaton
  • hidden markov models