Alternating automata on infinite trees
Theoretical Computer Science
A note on the reduction of two-way automata to one-way atuomata
Information Processing Letters
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating automata, the weak monadic theory of trees and its complexity
Theoretical Computer Science
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Temporal Logic with Fixed Points
Temporal Logic in Specification
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Adding nesting structure to words
Journal of the ACM (JACM)
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
On regular temporal logics with past
Acta Informatica
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Linear time logics around PSL: complexity, expressiveness, and a little bit of succinctness
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Temporal logics for concurrent recursive programs: satisfiability and model checking
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and µNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the previously given translations. Our alternation-elimination constructions are instances of an alternation-elimination scheme for automata that operate over the tree unfolding of graphs. We obtain these instances by providing constructions for complementing restricted classes of automata with respect to the graphs given by nested words. The scheme generalizes our alternation-elimination scheme for word automata and the presented complementation constructions generalize existing complementation constructions for word automata.