Title :
Finite-memory automata
Author :
Kaminski, Michael ; Francez, Nissim
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
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
Keywords :
finite automata; Rabin-Scott finite-state automata; equality test; finite-memory automata; infinite alphabets; unification; Automata; Automatic testing; Character recognition; Computational modeling; Computer science; Concurrent computing; Context; Database languages; Registers;
Conference_Titel :
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location :
St. Louis, MO
Print_ISBN :
0-8186-2082-X
DOI :
10.1109/FSCS.1990.89590
