Login / Signup

A note on emptiness for alternating finite automata with a one-letter alphabet.

Petr JancarZdenek Sawa
Published in: Inf. Process. Lett. (2007)
Keyphrases
  • finite automata
  • tree automata
  • regular expressions
  • probabilistic automata
  • deterministic automata
  • grammatical inference
  • high level
  • pattern matching
  • coalitional games
  • regular languages
  • databases
  • finite automaton