P Finite Automata and Regular Languages over Countably Infinite Alphabets
We examine the class of languages over countably infinite alphabets characterized by a class of restricted and simplified P automata variants, which we call P finite automata, and show that these classes possess several properties which make them perfect candidates for being the natural extension of the notion of finite automata and that of regular languages to infinite alphabets. To this aim, we also show that P finite automata are equivalent to a restricted variant of register machines, providing a more conventional automata theoretical characterization of the same infinite alphabet language class.
KeywordsEquality Check Regular Language Finite Automaton Input Symbol Input Alphabet
Unable to display preview. Download preview PDF.