Two models of automata over infinite alphabets are presented, mainly with a focus on the alphabet N. In the first model, transitions can refer to logic formulas that connect properties of successive letters. In the second, the letters are considered as columns of a labeled grid which an automaton traverses column by column. Thus, both models focus on the comparison of successive letters, i.e. “local changes”. We prove closure (and non-closure) properties, show the decidability of the respective non-emptiness problems, prove limits on decidability results for extended models, and discuss open issues in the development of a generalized theory.
CITATION STYLE
Czyba, C., Spinrath, C., & Thomas, W. (2015). Finite automata over infinite alphabets: Two models with transitions for local change. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9168, pp. 203–214). Springer Verlag. https://doi.org/10.1007/978-3-319-21500-6_16
Mendeley helps you to discover research relevant for your work.