Skip to main content
SpringerLink
Log in

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2012)

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

Included in the following conference series:

  • 574 Accesses

Abstract

We investigate the descriptional complexity of restarting automata, an automaton model inspired from linguistics. More precisely, we study the impact of the window size. For window sizes of at least two, it is shown that between any two levels of the RW- and RRW-automata hierarchy, there are savings in the economy of description of the automata which cannot be bounded by any recursive function. This is true even if the automata are deterministic and/or stateless. The trade-off between window sizes two and one is recursive for deterministic devices. In addition, we establish polynomial upper bounds for the trade-offs between RRWW-automata with window sizes k + 1 and k for all k ≥ 2.

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. Hartmanis, J.: On Gödel speed-up and succinctness of language representations. Theoret. Comput. Sci. 26, 335–342 (1983)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  3. Holzer, M., Kutrib, M., Reimann, J.: Non-recursive trade-offs for deterministic restarting automata. J. Autom. Lang. Comb. 12, 195–213 (2007)

    MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

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

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Kutrib, M., Malcher, A.: When Church-Rosser becomes context-free. Int. J. Found. Comput. Sci. 18, 1293–1302 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. Acta Inform. 47, 391–412 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Int. J. Found. Comput. Sci. 21, 781–798 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kutrib, M., Reimann, J.: Optimal simulations of weak restarting automata. Int. J. Found. Comput. Sci. 19, 795–811 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kutrib, M., Reimann, J.: Succinct description of regular languages by weak restarting automata. Inform. Comput. 206, 1152–1160 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

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

    MathSciNet  MATH  Google Scholar 

  14. Narendran, P., Ó’Dúnlaing, C., Rolletschek, H.: Complexity of certain decision problems about congruential languages. J. Comput. System Sci. 30, 343–358 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Niemann, G., Otto, F.: On the power of RRWW-automata. In: Ito, M., Păun, G., Yu, S. (eds.) Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin, pp. 341–355. World Scientific (2001)

    Google Scholar 

  16. Otto, F.: Restarting Automata. In: Ésik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. SCI, vol. 25, pp. 269–303. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Post, E.L.: Recursive unsolvability of a problem of Thue. J. Symbolic Logic 12, 1–11 (1947)

    Article  MathSciNet  Google Scholar 

  18. Schluter, N.: Restarting Automata with Auxiliary Symbols and Small Lookahead. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 499–510. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

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

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

    Friedrich Otto

Authors
  1. Martin Kutrib
    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

Editor information

Editors and Affiliations

  1. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055, 4169-007, Porto, Portugal

    Nelma Moreira  & Rogério Reis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kutrib, M., Otto, F. (2012). On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31606-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31605-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation