Relating Word and Tree Automata

In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's, it was known that deterministic B

• Type: Conference
• Year: 1996
• Where: LICS
• Authors: Orna Kupferman, Shmuel Safra, Moshe Y. Vardi
• Keywords: Automated Reasoning, B¨uchi Word Automata, LICS 1996, Rabin Tree Automata, Tree Automata