Finite-Memory Automata

@article{Kaminski1994FiniteMemoryA,
  title={Finite-Memory Automata},
  author={M. Kaminski and N. Francez},
  journal={Theor. Comput. Sci.},
  year={1994},
  volume={134},
  pages={329-363}
}
  • M. Kaminski, N. Francez
  • Published 1994
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • Abstract A model of computation dealing with infinite alphabets is proposed. This model is based on replacing the equality test by substitution. It appears to be a natural generalization of the classical Rabin-Scott finite-state automata and possesses many of their closure and decision properties. Also, when restricted to finite alphabets the model is equivalent to finite-state automata. 
    378 Citations

    Topics from this paper

    Automata theory in nominal sets
    • 88
    • PDF
    Residual Nominal Automata
    • PDF
    Finite-Memory Automata with Non-Deterministic Reassignment
    • 30
    • Highly Influenced
    A note on the emptiness problem for alternating finite-memory automata
    • 2
    Automata over Infinite Alphabets
    • 9
    • PDF
    Regular Expressions for Languages over Infinite Alphabets
    • 33
    • PDF
    Tree Automata over Infinite Alphabets
    • 36
    • PDF
    Class Counting Automata on Datawords
    • 7
    • PDF

    References

    SHOWING 1-10 OF 14 REFERENCES
    Finite-memory automata
    • M. Kaminski, N. Francez
    • Mathematics, Computer Science
    • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
    • 1990
    • 2
    • PDF
    Finite Automata and Their Decision Problems
    • 1,767
    • PDF
    The infinite state acceptor and its application to AI
    • 2
    The Reduction of Two-Way Automata to One-Way Automata
    • 280
    Finite-State Unification Automata and Relational Languages
    • 25
    Introduction to Automata Theory, Languages and Computation
    • 13,726
    • PDF
    Automata on Infinite Objects and Church's Problem
    • 320
    Parallel Program Schemata
    • 975
    • PDF