Login / Signup

Weak Muller acceptance conditions for tree automata.

Salvatore La TorreAniello MuranoMargherita Napoli
Published in: Theor. Comput. Sci. (2005)
Keyphrases
  • tree automata
  • finite automata
  • regular expressions
  • finite state
  • sufficient conditions
  • finite automaton
  • tree languages
  • syntactic pattern recognition
  • external factors
  • database
  • expert systems
  • context free grammars