FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS
From MaRDI portal
Publication:5286026
DOI10.1142/S0129054192000152zbMath0771.68076MaRDI QIDQ5286026
David E. Muller, Paul E. Schupp, Ahmed Saoudi
Publication date: 29 June 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
decidabilitybi-infinite words\(Z\)-regular grammars\(Z\)-regular languages\(Z\)-temporal logiccorrectness problem for finite state processes
Related Items
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, Parametric linear dynamic logic, Ambiguous classes in \(\mu\)-calculi hierarchies, Relating word and tree automata, Complexity of weak acceptance conditions in tree automata.
