Converting a Büchi alternating automaton to a usual nondeterministic one

DOI10.1007/BF02745520zbMath1028.68083MaRDI QIDQ5955787

Amar Isli

Publication date: 18 February 2002

Published in: Sādhanā (Search for Journal in Brave)

zbMATH Keywords

Büchi alternating automatonlinear propositional temporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Alternating finite automata on \(\omega\)-words
• Alternating automata on infinite trees
• The temporal semantics of concurrent programs
• Alternating automata, the weak monadic theory of trees and its complexity
• Temporal logic can be more expressive
• Synthesis of Communicating Processes from Temporal Logic Specifications
• Alternation
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item

This page was built for publication: Converting a Büchi alternating automaton to a usual nondeterministic one