Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
2018 ◽
Vol 29
(02)
◽
pp. 213-231
Two models of automata over infinite alphabets are presented, mainly with a focus on the alphabet [Formula: see text]. 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.
1997 ◽
Vol 11
(07)
◽
pp. 1023-1024
2006 ◽
Vol 16
(05)
◽
pp. 985-1014
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol 23
(06)
◽
pp. 1207-1225
◽
2016 ◽
Vol 27
(02)
◽
pp. 187-214
◽
2009 ◽
Vol 19
(4)
◽
pp. 737-756
◽
Keyword(s):