Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2019: Developments in Language Theory pp 140–153Cite as

On Shrinking Restarting Automata of Window Size One and Two

  • Conference paper
  • First Online:

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

Abstract

Here we study the expressive power of shrinking RWW- and RRWW-automata the window size of which is just one or two. We show that for shrinking RRWW-automata that are nondeterministic, window size one suffices, while for nondeterministic shrinking RWW-automata, we already need window size two to accept all growing context-sensitive languages. In the deterministic case, shrinking RWW- and RRWW-automata of window size one accept only regular languages, while those of window size two characterize the Church-Rosser languages. In addition, we study shrinking RWW- and RRWW-automata of window size one that are monotone.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. 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 

  4. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On monotonic automata with a restart operation. J. Aut. Lang. Comb. 4, 287–311 (1999)

    MathSciNet  MATH  Google Scholar 

  5. Jurdziński, T., Otto, F.: Shrinking restarting automata. Int. J. Found. Comput. Sci. 18, 361–385 (2007)

    Article  MathSciNet  Google Scholar 

  6. Kutrib, M., Reimann, J.: Succinct description of regular languages by weak restarting automata. In: Loos, R., Fazekas, S., Martin-Vide, C. (eds.) Preproc., LATA 2007, pp. 343–354. Report 35/07, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona (2007)

    Google Scholar 

  7. Kwee, K., Otto, F.: On ordered RRWW-automata. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 268–279. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53132-7_22

    Chapter  Google Scholar 

  8. 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 

  9. Kwee, K., Otto, F.: Nondeterministic ordered restarting automata. Int. J. Found. Comput. Sci. 29, 663–685 (2018)

    Article  MathSciNet  Google Scholar 

  10. Mráz, F.: Lookahead hierarchies of restarting automata. J. Aut. Lang. Comb. 6, 493–506 (2001)

    MathSciNet  MATH  Google Scholar 

  11. 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 

  12. Mraz, F., Otto, F.: Window size two suffices for deterministic monotone RWW-automata. In: Freund, R., Holzer, M., Sempere, J. (eds.) Proceedings of NCMA 2019, books@ocg.at, vol. 336, pp. 139–154. Österreichische Computer Gesellschaft, Wien (2019)

    Google Scholar 

  13. Niemann, G., Otto, F.: Restarting automata, Church-Rosser languages, and representations of r.e. languages. In: Rozenberg, G., Thomas, W. (eds.) Proceedings of DLT 1999, pp. 103–114. World Scientific, Singapore (2000)

    Google Scholar 

  14. Niemann, G., Otto, F.: Further results on restarting automata. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, Proceedings, pp. 352–369. World Scientific, Singapore (2003)

    Chapter  Google Scholar 

  15. Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inf. Comput. 197, 1–21 (2005)

    Article  Google Scholar 

  16. Otto, F.: On shrinking restarting automata. In: Freund, R., Mráz, F., Průša, D. (eds.) Proceedings of NCMA 2017, books@ocg.at, vol. 329, pp. 181–195. Österreichische Computer Gesellschaft, Wien (2017)

    Google Scholar 

  17. Schluter, N.: Restarting automata with auxiliary symbols restricted by lookahead size. Int. J. Comput. Math. 92, 908–938 (2015)

    Article  MathSciNet  Google Scholar 

  18. von Braunmühl, B., Verbeek, R.: Finite-change automata. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol. 67, pp. 91–100. Springer, Heidelberg (1979). https://doi.org/10.1007/3-540-09118-1_11

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Department of Computer Science, Charles University, Malostranské nám. 25, 118 00, Prague 1, Czech Republic

    František Mráz

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

    Friedrich Otto

Authors
  1. František Mráz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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 Warsaw, Warsaw, Poland

    Piotrek Hofman

  2. University of Warsaw, Warsaw, Poland

    Michał Skrzypczak

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mráz, F., Otto, F. (2019). On Shrinking Restarting Automata of Window Size One and Two. In: Hofman, P., Skrzypczak, M. (eds) Developments in Language Theory. DLT 2019. Lecture Notes in Computer Science(), vol 11647. Springer, Cham. https://doi.org/10.1007/978-3-030-24886-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24886-4_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24885-7

  • Online ISBN: 978-3-030-24886-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation