Finite-memory automata

@article{Kaminski1990FinitememoryA,
  title={Finite-memory automata},
  author={M. Kaminski and N. Francez},
  journal={Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science},
  year={1990},
  pages={683-688 vol.2}
}
  • M. Kaminski, N. Francez
  • Published 1990
  • Mathematics, Computer Science
  • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
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.<<ETX>> 
2 Citations
Finite-Memory Automata
  • 385
  • PDF
Symbolic tree automata
  • 10
  • PDF

References

SHOWING 1-9 OF 9 REFERENCES
The infinite state acceptor and its application to AI
  • 2
Finite Automata and Their Decision Problems
  • 1,776
  • PDF
The Reduction of Two-Way Automata to One-Way Automata
  • 282
Automata on Infinite Objects and Church's Problem
  • 321
Introduction to Automata Theory, Languages and Computation
  • 13,762
  • PDF
Parallel Program Schemata
  • 977
  • PDF
Principles Of Database And Knowledge-Base Systems
  • 1,704