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
Towards Regular Languages over Infinite Alphabets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
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)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
A characterisation of languages on infinite alphabets with nominal regular expressions
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
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.