An algebraic characterization of deterministic regular languages over infinite alphabets
Theoretical Computer Science
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Static analysis of XML processing with data values
ACM SIGMOD Record
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
On notions of regularity for data languages
Theoretical Computer Science
Safety alternating automata on data words
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Runtime verification based on register automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |