An algebraic characterization of deterministic regular languages over infinite alphabets
Theoretical Computer Science
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Static analysis of XML processing with data values
ACM SIGMOD Record
The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata
Languages: From Formal to Natural
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
Variable tree automata over infinite ranked alphabets
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Variable automata over infinite alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Hi-index | 0.02 |