Finite-memory automata

Authors:
M. Kaminski;N. Francez
Affiliations:
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel;Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 5

Towards Regular Languages over Infinite Alphabets

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Automata on Gauss Words

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Tree automata over infinite alphabets

Pillars of computer science
Symbolic finite state transducers: algorithms and applications

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Regular Expressions for Languages over Infinite Alphabets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A model of computation dealing with infinite alphabets is proposed. The model is based on replacing the equality test by unification. It appears to be a natural generalization of the classical Rabin-Scott finite-state automata and possesses many of their properties.