Login / Signup

Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata.

Zdenek Sawa
Published in: Fundam. Informaticae (2013)
Keyphrases
  • finite automata
  • grammatical inference
  • probabilistic automata
  • regular languages
  • regular expressions
  • deterministic automata
  • tree automata
  • finite automaton
  • context free grammars