Abstract
Two models of automata over infinite alphabets are presented, mainly with a focus on the alphabet \(\mathbb {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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bès, A.: An application of the feferman-vaught theorem to automata and logics for words over an infinite alphabet. Logical Methods in Computer Science 4(1) (2008)
Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: IEEE Conference Record of the Eighth Annual Symposium on Switching and Automata Theory, SWAT 1967, pp. 155–160. IEEE (1967)
Blumensath, A., Colcombet, T., Löding, C.: Logical theories and compatible operations. In: Flum, J., et al. (eds.) Logic and Automata: History and Perspectives, pp. 73–106. Amsterdam Univ. Press (2008)
Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Transactions on Computational Logic (TOCL) 12(4), 27 (2011)
Czyba, C., Spinrath, C., Thomas, W.: Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Full Version). RWTH Aachen University (2015). https://www.lii.rwth-aachen.de/en/86-finite-automata-over-infinite-alphabets.html
Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer Undergraduate Texts in Mathematics and Technology. Springer (1996)
Inoue, K., Takanami, I.: A note on decision problems for three-way two-dimensional finite automata. Information Processing Letters 10(4), 245–248 (1980)
Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 134(2), 329–363 (1994)
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall Inc, Upper Saddle River (1967)
Rosenfeld, A.: Picture languages. Academic Press (1979)
Spelten, A., Thomas, W., Winter, S.: Trees over infinite structures and path logics with synchronization. In: Yu, F., Wang, C. (eds.) Proceedings 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011, vol. 73, pp. 20–34. EPTCS, Taipei (2011)
Spelten, A.: Paths in Infinite Trees: Logics and Automata. PhD thesis, RWTH-Aachen University (2013)
Thomas, W.: On the bounded monadic theory of well-ordered structures. The Journal of Symbolic Logic 45(02), 334–338 (1980)
Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389–455. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Czyba, C., Spinrath, C., Thomas, W. (2015). Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. In: Potapov, I. (eds) Developments in Language Theory. DLT 2015. Lecture Notes in Computer Science(), vol 9168. Springer, Cham. https://doi.org/10.1007/978-3-319-21500-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-21500-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21499-3
Online ISBN: 978-3-319-21500-6
eBook Packages: Computer ScienceComputer Science (R0)