Abstract
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are two-way one-head automata that comprise a constant number of modulo counters, where the counter bounds are nondeterministically guessed, and this is the only element of nondeterminism. NBMCA are tailored to recognising those languages that are characterised by the existence of a specific factorisation of their words, e.g., pattern languages. In this work, we subject NBMCA to a theoretically sound analysis.
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
Chang, J.H., Ibarra, O.H., Palis, M.A., Ravikumar, B.: On pebble automata. Theoretical Computer Science 44, 111–121 (1986)
Frisco, P., Ibarra, O.H.: On Stateless Multihead Finite Automata and Multihead Pushdown Automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 240–251. Springer, Heidelberg (2009)
Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science 412, 83–96 (2011)
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25, 116–133 (1978)
Ibarra, O.H., Eğecioğlu, Ö.: Hierarchies and Characterizations of Stateless Multicounter Machines. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 408–417. Springer, Heidelberg (2009)
Ibarra, O.H., Karhumäki, J., Okhotin, A.: On stateless multihead automata: Hierarchies and the emptiness problem. Theoretical Computer Science 411, 581–593 (2010)
Ibarra, O.H., Ravikumar, B.: On partially blind multihead finite automata. Theoretical Computer Science 356, 190–199 (2006)
Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. International Journal of Foundations of Computer Science 21, 781–798 (2010)
Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO Informatique Théorique 14, 67–82 (1980)
Petersen, H.: Automata with sensing heads. In: Proc. 3rd Israel Symposium on Theory of Computing and Systems, pp. 150–157 (1995)
Reidenbach, D., Schmid, M.L.: A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 241–250. Springer, Heidelberg (2011)
Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and p systems. International Journal of Foundations of Computer Science 19, 1259–1276 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reidenbach, D., Schmid, M.L. (2012). Automata with Modulo Counters and Nondeterministic Counter Bounds. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)