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
Elements of the Theory of Computation
Elements of the Theory of Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Static analysis of XML processing with data values
ACM SIGMOD Record
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Tree automata over infinite alphabets
Pillars of 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
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
| Hi-index | 0.00 |
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is accepted by finite-state unification based automaton - a model of computation that is tightly related to other models of automata over infinite alphabets.