|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
31st Annual Symposium on Foundations of Computer Science (FOCS 1990)
Finite-memory automata (PDF)
St. Louis, MO, USA
October 22-October 24
ISBN: 0-8186-2082-X
| ASCII Text | x | ||
| M. Kaminski, N. Francez, "Finite-memory automata," Foundations of Computer Science, IEEE Annual Symposium on, pp. 683-688 vol.2, 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/FSCS.1990.89590, author = {M. Kaminski and N. Francez}, title = {Finite-memory automata}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1990}, isbn = {0-8186-2082-X}, pages = {683-688 vol.2}, doi = {http://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89590}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Finite-memory automata SN - 0-8186-2082-X SP683 EP688 vol.2 A1 - M. Kaminski, A1 - N. Francez, PY - 1990 KW - Rabin-Scott finite-state automata KW - finite-memory automata KW - infinite alphabets KW - equality test KW - unification VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
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.
Index Terms:
Rabin-Scott finite-state automata, finite-memory automata, infinite alphabets, equality test, unification
Citation:
M. Kaminski, N. Francez, "Finite-memory automata," focs, pp.683-688 vol.2, 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), 1990
Usage of this product signifies your acceptance of the Terms of Use.