|M.Sc Student||Zeitlin Daniel|
|Subject||Look-Ahead Finite-Memory Automata|
|Department||Department of Computer Science||Supervisor||Professor Michael Kaminski|
We introduce and study a new model of computation dealing with infinite alphabets. Our model is an extension of finite-memory automata (FMA) and is called look-ahead finite-memory automaton (LFMA). We show that LFMA languages possess all closure and decision properties of FMA languages and, in addition are closed under reversing. Also we introduce a new notion of a regular expression and a regular grammar over an infinite alphabet and show their equivalence to LFMA.