Skip to main content
SpringerLink
Log in

Self-verifying Cellular Automata

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2018)

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

Included in the following conference series:

Abstract

We study the computational capacity of self-verifying cellular automata with an emphasis on one-way information flow (\(\text {SVOCA}\)). A self-verifying device is a nondeterministic device where each computation path can give one of the answers yes, no, or do not know. For every input word, at least one computation path must give either the answer yes or no, and the answers given must not be contradictory. Realtime \(\text {SVOCA}\) are strictly more powerful than realtime deterministic one-way cellular automata. They can be sped-up from lineartime to realtime and are capable to simulate any lineartime computation of deterministic two-way CA. Closure and decidability properties are considered as well.

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 EPUB and 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

References

  1. Bucher, W., Čulik II, K.: On real time and linear time cellular automata. RAIRO Inform. Théor. 18, 307–325 (1984)

    Article  MathSciNet  Google Scholar 

  2. Buchholz, T., Klein, A., Kutrib, M.: On interacting automata with limited nondeterminism. Fundam. Inform. 52, 15–38 (2002)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Choffrut, C., Čulik II, K.: On real-time cellular automata and trellis automata. Acta Inform. 21, 393–407 (1984)

    Article  MathSciNet  Google Scholar 

  5. Chomsky, N.: Context-free grammars and pushdown storage. Tech report, QPR 65, Massachusetts Institute of Technology (1962)

    Google Scholar 

  6. Duriš, P., Hromkovič, J., Rolim, J.D.P., Schnitger, G.: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 117–128. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0023453

    Chapter  Google Scholar 

  7. Dyer, C.R.: One-way bounded cellular automata. Inf. Control 44, 261–281 (1980)

    Article  MathSciNet  Google Scholar 

  8. Fernau, H., Kutrib, M., Wendlandt, M.: Self-verifying pushdown automata. In: Freund, R., Mráz, F., Průša, D. (eds.) Non-Classical Models of Automata and Applications (NCMA 2017), vol. 329, pp. 103–117. Austrian Computer Society, Vienna (2017). books@ocg.at

    Google Scholar 

  9. Fischer, P.C., Kintala, C.M.R.: Real-time computations with restricted nondeterminism. Math. Syst. Theory 12, 219–231 (1979)

    Article  MathSciNet  Google Scholar 

  10. Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14, 389–418 (1967)

    Article  MathSciNet  Google Scholar 

  11. Hromkovic, J., Schnitger, G.: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Inf. Comput. 169, 284–296 (2001)

    Article  MathSciNet  Google Scholar 

  12. Hromkovic, J., Schnitger, G.: Nondeterministic communication with a limited number of advice bits. SIAM J. Comput. 33, 43–68 (2003)

    Article  MathSciNet  Google Scholar 

  13. Ibarra, O.H., Kim, S.M., Moran, S.: Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput. 14, 426–447 (1985)

    Article  MathSciNet  Google Scholar 

  14. Jirásková, G., Pighizzini, G.: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209, 528–535 (2011)

    Article  MathSciNet  Google Scholar 

  15. Kutrib, M.: Cellular automata and language theory. In: Meyers, R. (ed.) Encyclopedia of Complexity and System Science, pp. 800–823. Springer, Heidelberg (2009). https://doi.org/10.1007/978-0-387-30440-3

    Chapter  Google Scholar 

  16. Kutrib, M.: Non-deterministic cellular automata and languages. Int. J. Gen. Syst. 41, 555–568 (2012)

    Article  MathSciNet  Google Scholar 

  17. Kutrib, M., Worsch, Th.: Self-verifying cellular automata. Technical report, 1803, Universität Gießen (2018). http://www.informatik.uni-giessen.de/reports/Report1803.pdf

  18. Malcher, A.: Descriptional complexity of cellular automata and decidability questions. J. Autom. Lang. Comb. 7, 549–560 (2002)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. Umeo, H., Morita, K., Sugata, K.: Deterministic one-way simulation of two-way real-time cellular automata and its related problems. Inf. Process. Lett. 14, 158–161 (1982)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Martin Kutrib

  2. Karlsruhe Institute of Technology, Karlsruhe, Germany

    Thomas Worsch

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Worsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Worsch .

Editor information

Editors and Affiliations

  1. University of Milano-Bicocca, Milan, Italy

    Giancarlo Mauri

  2. University of Perpignan, Perpignan, France

    Samira El Yacoubi

  3. University of Milano-Bicocca, Milan, Italy

    Alberto Dennunzio

  4. University of Tokyo, Tokyo, Japan

    Katsuhiro Nishinari

  5. University of Milano-Bicocca, Milan, Italy

    Luca Manzoni

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kutrib, M., Worsch, T. (2018). Self-verifying Cellular Automata. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds) Cellular Automata. ACRI 2018. Lecture Notes in Computer Science(), vol 11115. Springer, Cham. https://doi.org/10.1007/978-3-319-99813-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99813-8_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99812-1

  • Online ISBN: 978-3-319-99813-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation