Finite-state unification automata and relational languages
Information and Computation
Theoretical Computer Science
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Automates a pile sur des alphabets infinis
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Static analysis of XML processing with data values
ACM SIGMOD Record
Automata vs. logics on data words
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A succinct canonical register automaton model
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A succinct canonical register automaton model for data domains with binary relations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 5.23 |
We state and prove an infinite alphabet counterpart of the classical Myhill-Nerode theorem.