scientific article; zbMATH DE number 3999901
From MaRDI portal
Publication:4726235
zbMath0617.03020MaRDI QIDQ4726235
Paul E. Schupp, David E. Muller, Ahmed Saoudi
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Synchronized tree automata ⋮ Index Problems for Game Automata ⋮ Automata Theory and Model Checking ⋮ Extending Co-logic Programs for Branching-Time Model Checking ⋮ Alternating automata on infinite trees ⋮ On the Weak Index Problem for Game Automata ⋮ A gap property of deterministic tree languages. ⋮ A space-efficient on-the-fly algorithm for real-time model checking ⋮ Unnamed Item ⋮ Alternating automata with start formulas ⋮ Yield-languages recognized by alternating tree recognizers ⋮ Generalized automata on infinite trees and Muller-McNaughton's theorem ⋮ Certifying inexpressibility ⋮ On automata on infinite trees ⋮ Fairness and regularity for SCCS processes ⋮ Alternating automata, the weak monadic theory of trees and its complexity ⋮ The Borel hierarchy is infinite in the class of regular sets of trees ⋮ On mathematical contributions of Paul E. Schupp ⋮ On Distributive Fixed-Point Expressions ⋮ Automata on infinite objects and their applications to logic and programming ⋮ From LTL to Symbolically Represented Deterministic Automata ⋮ On Repetition Languages ⋮ Alternating automata: Unifying truth and validity checking for temporal logics ⋮ Projection for Büchi Tree Automata with Constraints between Siblings ⋮ Hierarchies of weak automata and weak monadic formulas
This page was built for publication:
