Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1998: Foundations of Software Technology and Theoretical Computer Science pp 343–354Cite as

Different Types of Monotonicity for Restarting Automata

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1530))

Abstract

We consider several classes of rewriting automata with a restart operation and the monotonicity property of computations by such automata. It leads to three natural definitions of (right) monotonicity of automata. Besides the former monotonicity, two new types, namely a-monotonicity and g-monotonicity, for such automata are introduced. We provide a taxonomy of the relevant language classes, and answer the (un)decidability questions concerning these properties.

Supported by the Grant Agency of the Czech Republic, Grant-No. 201/96/0195

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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buntrock, G., Otto, F.: Growing Context-Sensitive Languages and Church-Rosser Languages. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 313–324. Springer, Heidelberg (1995)

    Google Scholar 

  2. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)

    Google Scholar 

  3. Ehrenfeucht, A., Păun, G., Rozenberg, G.: Contextual Grammars and Formal Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Linear Modeling: Background and Application, vol. 2, pp. 237–293. Springer, Berlin (1997)

    Google Scholar 

  4. Kunze, J.: Abhängigkeitsgrammatik. Studia Grammatica XII, Berlin (1975)

    Google Scholar 

  5. Mráz, F., Plátek, M., Jančar, P., Vogel, J.: Restarting Automata with Rewriting. In: Jeffery, K. (ed.) SOFSEM 1997. LNCS, vol. 1338, pp. 505–512. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On Monotonicity for Restarting Automata. Accepted to workshop Mathematical Linguistics on MFCS 1998, Brno (1998)

    Google Scholar 

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

    Google Scholar 

  8. Sénizergues, G.: A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. Theoretical Computer Science 70, 671–681 (1990)

    Article  Google Scholar 

  9. Sénizergues, G.: The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 671–681. Springer, Heidelberg (1997)

    Google Scholar 

  10. Sgall, P., Panevová, J.: Dependency Syntax – a Challenge. Theoretical Linguistics 15(1/2), 73–86 (1988/1989)

    Google Scholar 

  11. Marcus, S.: Contextual Grammars and Natural Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Linear Modeling: Background and Application, vol. 2, pp. 215–235. Springer, Berlin (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Technical University of Ostrava, 17. listopadu 15, 708 33, Ostrava, Czech Republic

    Petr Jančar

  2. Department of Computer Science, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    František Mráz & Martin Plátek

  3. Computer Science Institute, Friedrich Schiller University, 07740, Jena, Germany

    Jörg Vogel

Authors
  1. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. František Mráz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Plátek
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jörg Vogel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Vikraman Arvind

  2. National Institute of Advanced Studies, Indian Institute of Science Campus, 560012, Bangalore, India

    Sundar Ramanujam

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jančar, P., Mráz, F., Plátek, M., Vogel, J. (1998). Different Types of Monotonicity for Restarting Automata. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49382-2_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65384-4

  • Online ISBN: 978-3-540-49382-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation