Abstract
We give a survey on the descriptional complexity of cellular models including one-way and two-way cellular automata, iterative arrays, and models with a fixed number of cells. For the former models so-called non-recursive trade-offs can be shown, that is, the savings in size that such automata may provide are not bounded by any recursive function. A consequence is that almost all commonly studied decidability questions are undecidable and not even semidecidable for such automata. On the other hand, for the latter models with a fixed number of cells it is possible to show recursive, in particular, polynomial bounds for mutual transformations which yield the decidability of the standard questions. Finally, we summarize results on the state complexity of the Boolean operations for one-way cellular automata and their variant with a fixed number of cells.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bordihn, H., Kutrib, M., Malcher, A.: Undecidability and hierarchy results for parallel communicating finite automata. Int. J. Found. Comput. Sci. 22, 1577–1592 (2011)
Bordihn, H., Kutrib, M., Malcher, A.: On the computational capacity of parallel communicating finite automata. Int. J. Found. Comput. Sci. 23, 713–732 (2012)
Bordihn, H., Kutrib, M., Malcher, A.: Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities. Int. J. Found. Comput. Sci. 26, 1101–1126 (2015)
Buchholz, T., Klein, A., Kutrib, M.: Iterative arrays with small time bounds. In: M. Nielsen, B. Rovan (eds.) Mathematical Foundations of Computer Science (MFCS 2000), LNCS, vol. 1893, pp. 243–252 (2000)
Cole, S.N.: Real-time computation by \(n\)-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C–18(4), 349–365 (1969)
Delorme, M., Mazoyer, J. (eds.): Cellular Automata – a Parallel Model. Kluwer Academic Publishers, Dordrechtd (1999)
Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Autom. Lang. Comb. 21(4), 251–310 (2017)
Holzer, M., Kutrib, M.: Nondeterministic finite automata - Recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20, 563–580 (2009)
Holzer, M., Kutrib, M.: Descriptional complexity – an introductory survey. In: Martín-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1–58. Imperial College Press, London (2010)
Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - A survey. Inf. Comput. 209, 456–470 (2011)
Hopcroft, J.E., et al.: An \(n\) log \(n\) algorithm for minimizing states in a finite automaton. In: Kohavi, Z. (ed.) Theory of Machines and Computations, pp. 189–196. Academic Press, Cambridge (1971)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Cambridge (1979)
Jirásková, G., Okhotin, A.: On the state complexity of operations on two-way finite automata. In: M. Ito, M. Toyama (eds.) Developments in Language Theory (DLT 2008), LNCS, vol. 5257, pp. 443–454. Springer (2008)
Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334, 3–33 (2005)
Klein, A., Kutrib, M.: Fast one-way cellular automata. Theoret. Comput. Sci. 295, 233–250 (2003)
Klein, A., Kutrib, M.: Cellular devices and unary languages. Fund. Inform. 78, 343–368 (2007)
Kutrib, M.: Cellular automata – a computational point of view. In: Bel-Enguix, G., Jiménez-López, M.D., Martín-Vide, C. (eds.) New Developments in Formal Languages and Applications, vol. 6, pp. 183–227. Springer, Berlin (2008)
Kutrib, M.: Cellular automata and language theory. In: Meyers, R. (ed.) Encyclopedia of Complexity and System Science, pp. 800–823. Springer, Berlin (2009)
Kutrib, M., Lefèvre, J., Malcher, A.: The size of one-way cellular automata. In: Fatès, N., Kari, J., Worsch, T. (eds.) AUTOMATA 2010, Discrete Mathematics and Theoretical Computer Science Proceedings, pp. 71–90. DMTCS (2010)
Kutrib, M., Malcher, A.: Computations and decidability of iterative arrays with restricted communication. Parallel Process. Lett. 19, 247–264 (2009)
Kutrib, M., Malcher, A.: Cellular automata with limited inter-cell bandwidth. Theoret. Comput. Sci. 412, 3917–3931 (2011)
Kutrib, M., Malcher, A.: The size impact of little iterative array resources. J. Cell. Autom. 7, 489–507 (2012)
Kutrib, M., Malcher, A.: Iterative arrays with set storage. J. Cell. Autom. 12, 7–26 (2017)
Kutrib, M., Malcher, A., Wendlandt, M.: Stateless one-way multi-head finite automata with pebbles. Int. J. Found. Comput. Sci. 25, 1141–1160 (2014)
Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Berlin (1993)
Malcher, A.: Descriptional complexity of cellular automata and decidability questions. J. Autom. Lang. Comb. 7, 549–560 (2002)
Malcher, A.: On one-way cellular automata with a fixed number of cells. Fund. Inform. 58, 355–368 (2003)
Malcher, A.: Beschreibungskomplexität von Zellularautomaten. Ph.D. thesis, Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main (2004)
Malcher, A.: On the descriptional complexity of iterative arrays. IEICE Trans. Inf. Syst. E87–D, 721–725 (2004)
Malcher, A.: On two-way communication in cellular automata with a fixed number of cells. Theor. Comput. Sci. 330, 325–338 (2005)
Malcher, A., Mereghetti, C., Palano, B.: Sublinearly space bounded iterative arrays. Int. J. Found. Comput. Sci. 21, 843–858 (2010)
Martín-Vide, C., Mateescu, A., Mitrana, V.: Parallel finite automata systems communicating by states. Int. J. Found. Comput. Sci. 13, 733–749 (2002)
Martín-Vide, C., Mitrana, V.: Some undecidable problems for parallel communicating finite automata systems. Inf. Process. Lett. 77, 239–245 (2001)
Mazoyer, J., Terrier, V.: Signals in one-dimensional cellular automata. Theor. Comput. Sci. 217, 53–80 (1999)
Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Symposium on Switching and Automata Theory (SWAT 1971), pp. 188–191. IEEE (1971)
Morita, K.: Reversible computing and cellular automata - A survey. Theor. Comput. Sci. 395, 101–131 (2008)
Nakamura, K.: Real-time language recognition by one-way and two-way cellular automata. In: M. Kutyłowski, L. Pacholski, T. Wierzbicki (eds.) Mathematical Foundations of Computer Science (MFCS 1999), LNCS, vol. 1672, pp. 220–230. Springer (1999)
Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. SIGACT News 45, 47–67 (2014)
Rozenberg, G., Bäck, T., Kok, J.N. (eds.): Handbook of Natural Computing. Springer, Berlin (2012)
Seidel, S.R.: Language recognition and the synchronization of cellular automata. Tech. Rep. 79-02, Department of Computer Science, University of Iowa (1979)
Smith III, A.R.: Cellular automata and formal languages. In: Symposium on Switching and Automata Theory (SWAT 1970), pp. 216–224. IEEE (1970)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, Berlin (1997)
Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221–234 (2001)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315–328 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Kutrib, M., Malcher, A. (2018). Cellular Automata: Descriptional Complexity and Decidability. In: Adamatzky, A. (eds) Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer, Cham. https://doi.org/10.1007/978-3-319-73216-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-73216-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73215-2
Online ISBN: 978-3-319-73216-9
eBook Packages: EngineeringEngineering (R0)