Different types of monotonicity for restarting automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1530 LNCS, Issue , 1998, Pages 343-355

  Jančar, Petr ^a   Mráz, František ^b   Plátek, Martin ^b   Vogel, Jörg ^c  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECIDABILITY QUESTIONS; MONOTONICITY; MONOTONICITY PROPERTY; RESTARTING AUTOMATA;

COMPUTABILITY AND DECIDABILITY; SOFTWARE ENGINEERING;

AUTOMATA THEORY;

EID: 84887042143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_32     Document Type: Conference Paper

References (11)

1. Buntrock, G., Otto, F.: Growing Context-Sensitive Languages and Church-Rosser Languages. In: STACS'95, Lecture Notes in Computer Science, Vol. 900. Springer- Verlag, Berlin Heidelberg New York (1995) 313-324 354
2. Dassow, J., Pǎun, Gh.: Regulated Rewriting in Formal Language Theory. Springer- Verlag, Berlin Heidelberg New York (1989)
3. Ehrenfeucht, A., Pǎun, Gh., Rozenberg, G.: Contextual Grammars and Formal Languages. In: Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 2: Linear Modeling: Background and Application. Springer-Verlag, Berlin Heidelberg New York (1997) 237-293 344
4. Kunze, J.: Abhängigkeitsgrammatik. Studia Grammatica XII. Berlin (1975) 344
5. Mráz, F., Plátek, M., Jančar, P., Vogel, J.: Restarting Automata with Rewriting. In: Plášil, F., Jeffery, K.J. (eds.): SOFSEM'97: Theory and Practice of Informatics. Lecture Notes in Computer Science, Vol. 1338. Springer-Verlag, Berlin Heidelberg New York (1997) 505-512 345, 348
6. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On Monotonicity for Restarting Automata. Accepted to workshop Mathematical Linguistics on MFCS'98, Brno (1998) 348, 349, 352
7. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On Restarting Automata with Rewriting. In: Paun, Gh., Salomaa, A. (eds.): New Trends in Formal Languages (Control, Cooperation and Combinatorics). Lecture Notes in Computer Science, Vol. 1218. Springer-Verlag, Berlin Heidelberg New York (1997) 119-136 348, 349, 352 (Pubitemid 127061854)
8. Sénizergues, G.: A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. Theoretical Computer Science 70 (1990) 671-681 354
9. Sénizergues, G.: The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.): Proc. ICALP'97. Lecture Notes in Computer Science, Vol. 1256. Springer-Verlag, Berlin Heidelberg New York (1997) 671-681 351 (Pubitemid 127097781)
10. Sgall, P., Panevová, J.: Dependency Syntax-a Challenge. Theoretical Linguistics, Vol.15, No.1/2. Walter de Gruyter, Berlin New York (1988/89) 73-86 344
11. Marcus, S.: Contextual Grammars and Natural Languages. In: Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 2: Linear Modeling: Background and Application. Springer-Verlag, Berlin Heidelberg New York (1997) 215- 235 343, 344