Abstract
This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k + 1)-head automata. Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. We introduce ultrametric Turing machines and ultrametric multi-register machines to assist in proving the results.
This is a preview of subscription content, log in via an institution to check access.
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
Balodis, K., Beriņa, A., Cīpola, K., Dimitrijevs, M., Iraids, J., Jēriņš, K., Kacs, V., Kalējs, J., Krišlauks, R., Lukstiņš, K., Raumanis, R., Scegulnaja, I., Somova, N., Vanaga, A., Freivalds, R.: On the state complexity of ultrametric finite automata. In: SOFSEM 2013: Theory and Practice of Computer Science. vol. 2, pp. 1–9 (2013)
Dragovich, B., Dragovich, A.: A p-adic model of DNA sequence and genetic code. p-Adic Numbers, Ultrametric Analysis, and Applications 1(1), 34–41 (2009)
Freivalds, R.: Ultrametric automata and Turing machines. In: Voronkov, A. (ed.) Turing-100. EPiC Series, vol. 10, pp. 98–112. EasyChair (2012)
Freivalds, R.: Language recognition using finite probabilistic multitape and multihead automata. Problemy Peredachi Informatsii 15(3), 99–106 (1979) (in Russian)
Holzer, M., Kutrib, M., Malcher, A.: Multi-head finite automata: Characterizations, concepts and open problems. Electronic Proceedings in Theoretical Computer Science 1, 93–107 (2009), http://dx.doi.org/10.4204/EPTCS.1.9
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
Kozyrev, S.V.: Ultrametric analysis and interbasin kinetics, pp. 121–128. American Institute of Physics (2006)
Krišlauks, R., Rukšāne, I., Balodis, K., Kucevalovs, I., Freivalds, R., Nāgele, I.: Ultrametric Turing machines with limited reversal complexity. In: SOFSEM 2013: Theory and Practice of Computer Science. vol. 2, pp. 87–94 (2013)
Macarie, I.: Multihead two-way probabilistic finite automata. In: Baeza-Yates, R., Poblete, P.V., Goles, E. (eds.) LATIN 1995. LNCS, vol. 911, pp. 371–385. Springer, Heidelberg (1995), http://dx.doi.org/10.1007/3-540-59175-3_103
Madore, D.A.: A first introduction to p-adic numbers. Online (2000), http://www.madore.org/~david/math/padics.eps
Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO - Theoretical Informatics and Applications - Informatique Thorique et Applications 14(1), 67–82 (1980)
Turakainen, P.: Generalized automata and stochastic languages. Proceedings of The American Mathematical Society 21, 303–309 (1969)
Yao, A.C., Rivest, R.L.: k + 1 heads are better than k. vol. 25, pp. 337–340. ACM, New York (1978), http://doi.acm.org/10.1145/322063.322076
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krišlauks, R., Balodis, K. (2015). On the Hierarchy Classes of Finite Ultrametric Automata. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, JJ., Wattenhofer, R. (eds) SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015. Lecture Notes in Computer Science, vol 8939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46078-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-46078-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46077-1
Online ISBN: 978-3-662-46078-8
eBook Packages: Computer ScienceComputer Science (R0)