Skip to main content
SpringerLink
Log in

Iterative Arrays: Little Resources Big Size Impact

  • Conference paper
Cellular Automata (ACRI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7495))

Included in the following conference series:

  • 2753 Accesses

Abstract

We investigate the descriptional complexity of little resources added to deterministic one-dimensional real-time iterative arrays. More precisely, we study the impact of adding sublinearly more time obtaining time complexities strictly in between real time and linear time, adding dimensions, allow the communication cell to perform a few nondeterministic steps, and increase the number of bits that may be communicated to neighboring cells slightly. In all cases it is shown that there are arbitrary savings in the size of the descriptions of the arrays which cannot be bounded by any computable function.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beyer, W.T.: Recognition of topological invariants by iterative arrays. Tech. Rep. TR-66. MIT, Cambridge, Proj. MAC (1969)

    Google Scholar 

  2. Buchholz, T., Klein, A., Kutrib, M.: Iterative Arrays with Small Time Bounds. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 243–252. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Buchholz, T., Klein, A., Kutrib, M.: Iterative arrays with limited nondeterministic communication cell. In: Words, Languages and Combinatorics III, pp. 73–87. World Scientific Publishing (2003)

    Google Scholar 

  4. Buchholz, T., Kutrib, M.: Some relations between massively parallel arrays. Parallel Comput. 23, 1643–1662 (1997)

    Article  MathSciNet  Google Scholar 

  5. Buchholz, T., Kutrib, M.: On time computability of functions in one-way cellular automata. Acta Inform. 35, 329–352 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chang, J.H., Ibarra, O.H., Palis, M.A.: Parallel parsing on a one-way array of finite-state machines. IEEE Trans. Comput. C-36, 64–75 (1987)

    Google Scholar 

  7. Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C-18, 349–365 (1969)

    Google Scholar 

  8. Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. ACM 12, 388–394 (1965)

    Article  MATH  Google Scholar 

  9. Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS 8, 193–234 (2002)

    MathSciNet  Google Scholar 

  10. Gruber, H., Holzer, M., Kutrib, M.: On measuring non-recursive trade-offs. J. Autom., Lang. Comb. 15, 107–120 (2010)

    Google Scholar 

  11. Holzer, M., Kutrib, M.: Descriptional complexity – An introductory survey. In: Scientific Appl. of Language Methods, pp. 1–58. Imperial College Press (2010)

    Google Scholar 

  12. Ibarra, O.H., Jiang, T.: On one-way cellular arrays. SIAM J. Comput. 16, 1135–1154 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ibarra, O.H., Palis, M.A.: Some results concerning linear iterative (systolic) arrays. J. Parallel Distributed Comput. 2, 182–218 (1985)

    Article  Google Scholar 

  14. Ibarra, O.H., Palis, M.A.: Two-dimensional iterative arrays: Characterizations and applications. Theoret. Comput. Sci. 57, 47–86 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kutrib, M.: The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci. 16, 957–973 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kutrib, M., Malcher, A.: Computations and decidability of iterative arrays with restricted communication. Parallel Process. Lett. 19, 247–264 (2009)

    Article  MathSciNet  Google Scholar 

  17. Kutrib, M., Malcher, A.: Cellular automata with limited inter-cell bandwidth. Theoret. Comput. Sci. 412, 3917–3931 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Malcher, A.: On the descriptional complexity of iterative arrays. IEICE Trans. Inf. Syst. E87-D(3), 721–725 (2004)

    MathSciNet  Google Scholar 

  19. Malcher, A., Mereghetti, C., Palano, B.: Sublinearly space bounded iterative arrays. Int. J. Found. Comput. Sci. 21, 843–858 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  20. Mazoyer, J., Terrier, V.: Signals in one-dimensional cellular automata. Theoret. Comput. Sci. 217, 53–80 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  21. 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)

    Google Scholar 

  22. Seiferas, J.I.: Linear-time computation by nondeterministic multidimensional iterative arrays. SIAM J. Comput. 6, 487–504 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  23. Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6, 233–253 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  24. Stearns, R.E.: A regularity test for pushdown machines. Inform. Control 11, 323–340 (1967)

    Article  MATH  Google Scholar 

  25. Terrier, V.: On real time one-way cellular array. Theoret. Comput. Sci. 141, 331–335 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  26. Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. J. ACM 22, 1–10 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Martin Kutrib & Andreas Malcher

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Malcher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Laboratory of Electronics, Democritus University of Thrace, GR 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  2. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20134, Milano, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kutrib, M., Malcher, A. (2012). Iterative Arrays: Little Resources Big Size Impact. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation