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
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 Languages over Infinite Alphabets
Fundamenta Informaticae
Hi-index | 0.00 |