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
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
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)
Kunze, J.: Abhängigkeitsgrammatik. Studia Grammatica XII, Berlin (1975)
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)
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)
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)
Sénizergues, G.: A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. Theoretical Computer Science 70, 671–681 (1990)
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)
Sgall, P., Panevová, J.: Dependency Syntax – a Challenge. Theoretical Linguistics 15(1/2), 73–86 (1988/1989)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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