Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Theoretical Computer Science
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Feasible automata for two-variable logic with successor on data words
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
An Automata Model for Trees with Ordered Data Values
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety one-way alternating automata with one register on infinite data words are considered, their nonemptiness is shown to be ExpSpace-complete, and their inclusion decidable but not primitive recursive. The same complexity bounds are obtained for satisfiability and refinement, respectively, for the safety fragment of linear temporal logic with freeze quantification. Dropping the safety restriction, adding past temporal operators, or adding one more register, each causes undecidability.