Skip to main content
SpringerLink
Log in

A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata

  • Conference paper
  • First Online:
Book cover SOFSEM 2020: Theory and Practice of Computer Science (SOFSEM 2020)

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

Abstract

We consider stateless ordered restart-delete automata, which are actually just stateless ordered restarting automata (stl-ORWW-automata) that have an additional delete operation. While the stl-ORWW-automata just accept the regular languages, we show that the context-free languages are characterized by the swift stateless ordered restart-delete automaton, that is, by the stateless ordered restart-delete automaton that can move its window to any position after performing a restart.

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. Book, R., Otto, F.: String-Rewriting Systems. Springer, New York (1993). https://doi.org/10.1007/978-1-4613-9771-7_3

    Book  MATH  Google Scholar 

  2. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inf. Comput. 141, 1–36 (1998)

    Article  MathSciNet  Google Scholar 

  3. Černo, P., Mráz, F.: Clearing restarting automata. Fund. Inform. 104, 17–54 (2010)

    Article  MathSciNet  Google Scholar 

  4. Dahlhaus, E., Warmuth, M.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33, 456–472 (1986)

    Article  MathSciNet  Google Scholar 

  5. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283–292. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60249-6_60

    Chapter  Google Scholar 

  6. Kwee, K., Otto, F.: On the effects of nondeterminism on ordered restarting automata. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 369–380. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49192-8_30

    Chapter  MATH  Google Scholar 

  7. Lopatková, M., Plátek, M., Sgall, P.: Towards a formal model for functional generative description: analysis by reduction and restarting automata. Prague Bull. Math. Linguist. 87, 7–26 (2007)

    Google Scholar 

  8. McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM 35, 324–344 (1988)

    Article  MathSciNet  Google Scholar 

  9. Mráz, F., Otto, F.: Ordered restarting automata for picture languages. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 431–442. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-04298-5_38

    Chapter  Google Scholar 

  10. Otto, F.: Restarting automata. In: Ésik, Z., Martín-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Berlin (2006)

    Google Scholar 

  11. Otto, F.: On the descriptional complexity of deterministic ordered restarting automata. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 318–329. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09704-6_28

    Chapter  MATH  Google Scholar 

  12. Otto, F.: On deterministic ordered restart-delete automata. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 529–540. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98654-8_43

    Chapter  Google Scholar 

  13. Otto, F.: On deterministic ordered restart-delete automata. Theor. Comp. Sci. 795, 257–274 (2019)

    Article  MathSciNet  Google Scholar 

  14. Rosenkrantz, D.J.: Matrix equations and normal forms for context-free grammars. J. ACM 14, 501–507 (1967)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Friedrich Otto

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Friedrich Otto .

Editor information

Editors and Affiliations

  1. University of Macedonia, Thessaloniki, Greece

    Alexander Chatzigeorgiou

  2. University of Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Cyprus University of Technology, Limassol, Cyprus

    Herodotos Herodotou

  4. Carnegie Mellon University Qatar, Doha, Qatar

    Christos Kapoutsis

  5. Open University of Cyprus, Nicosia, Cyprus

    Yannis Manolopoulos

  6. University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  7. Paris Dauphine University, Paris, France

    Florian Sikora

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Otto, F. (2020). A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38919-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38918-5

  • Online ISBN: 978-3-030-38919-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation