Skip to main content
SpringerLink
Log in

Deleting Deterministic Restarting Automata with Two Windows

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2017)

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

Included in the following conference series:

  • 523 Accesses

Abstract

We study deterministic restarting automata with two windows. In each cycle of a computation, these det-2-RR-automata can perform up to two delete operations, one with each of their two windows. We study the class of languages accepted by these automata, comparing it to other well-known language classes and exploring closure properties.

F. Mráz was supported by the Czech Science Foundation under the project 15-04960S.

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. Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher, Teubner-Verlag, Stuttgart (1979)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Chrobak, M.: Hierarchies of one-way multihead automata languages. Theor. Comput. Sci. 48, 153–181 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chrobak, M., Li, M.: \(k+1\) heads are better than \(k\) for PDAs. J. Comput. Syst. Sci. 37, 144–155 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  5. Culy, C.: Formal properties of natural language and linguistic theories. Linguist. Philos. 19, 599–617 (1996)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Gramatovici, R., Martín-Vide, C.: Sorted dependency insertion grammars. Theor. Comput. Sci. 354, 142–152 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: origins and directions. Theor. Comput. Sci. 412, 83–96 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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). doi:10.1007/3-540-60249-6_60

    Chapter  Google Scholar 

  10. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On restarting automata with rewriting. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 119–136. Springer, Heidelberg (1997). doi:10.1007/3-540-62844-4_8

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  12. Jurdziński, T., Loryś, K., Niemann, G., Otto, F.: Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages. J. Autom. Lang. Comb. 9, 407–437 (2004)

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Mráz, F., Otto, F., Plátek, M.: Free word-order and restarting automata. Fundam. Inf. 133, 399–419 (2014)

    MathSciNet  MATH  Google Scholar 

  16. 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, Heidelberg (2006). doi:10.1007/978-3-540-33461-3_11

    Chapter  Google Scholar 

  17. Otto, F., Plátek, M.: A two-dimensional taxonomy of proper languages of lexicalized FRR-automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 409–420. Springer, Heidelberg (2008). doi:10.1007/978-3-540-88282-4_37

    Chapter  Google Scholar 

  18. Pardubská, D., Plátek, M., Otto, F.: Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. Theor. Comput. Sci. 412, 458–477 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Plátek, M., Mráz, F., Lopatková, M.: (In)dependencies in functional generative description by restarting automata. In: Bordihn, H., Freund, R., Hinze, T., Holzer, M., Kutrib, M., Otto, F. (eds.) Proceedings of NCMA 2010. books@acg.at, vol. 263, pp. 155–170. Österreichische Computer Gesellschaft, Vienna (2010)

    Google Scholar 

  20. Plátek, M., Mráz, F., Lopatková, M.: Restarting automata with structured output and functional generative description. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 500–511. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13089-2_42

    Chapter  Google Scholar 

  21. Rambow, O., Joshi, A.: A processing model for free word order languages. In: Clifton, C., Frazier, L., Rayner, K. (eds.) Perspectives on Sentence Processing, pp. 267–302. Lawrence Erlbaum Associates, Hillsdale (1994)

    Google Scholar 

  22. Sudborough, H.: One-way multihead writing finite automata. Inf. Control 30, 1–20 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, 118 00, Praha 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. Université de Liège, Liège, Belgium

    Émilie Charlier

  2. Université de Liège, Liège, Belgium

    Julien Leroy

  3. Université de Liège, Liège, Belgium

    Michel Rigo

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Mráz, F., Otto, F. (2017). Deleting Deterministic Restarting Automata with Two Windows. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62809-7_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62808-0

  • Online ISBN: 978-3-319-62809-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation