Two-way restarting automata and j-monotonicity

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

Volumn 2234, Issue , 2001, Pages 316-325

  Plàtek, Martin ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GENERAL MODEL; LINGUISTIC MOTIVATION; MONOTONICITY; RESTARTING AUTOMATA; TWO WAYS; TWO-WAY AUTOMATA;

AUTOMATA THEORY;

EID: 84943248357     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45627-9_28     Document Type: Conference Paper

References (10)

1. Jančar, P., Mràz, F., Plàtek, M., Vogel, J.: On Monotonic Automata with a Restart Operation. Journal of Automata, Languages and Combinatorics 4 (1999) 287–311
2. Holan, T., Kuboň, V., Oliva, K., Plàtek, M.: Two useful measures of word order complexity. In: Polguère, A., Kahane, S. (eds): Proceedings of the Workshop ‘Processing of Dependency-Based Grammars’, Universitè de Montrèal, Montrèal, Quebeck, Canada, August (1998) 21–28
3. Holan, T., Kuboň, V., Oliva, K., Plàtek M.: On Complexity of Word Order. T.A.L, vol. 41. no 1 (2000) 243–267
4. Mràz, F.: Lookahead hierarchies of restarting automata. In: O.Boldt, H. Jurgensen (eds.): Pre-Procedings of DCAGRS 2000, Dept. of Comp. Science, The University of Western Ontario, London, Canada (2000)
5. Niemann, G., Otto, F.: Restarting automata, Church Rosser languages, and representations of r.e. languages. In: Rozenberg G., Thomas, W. (eds.): Developments in Language Theory. Foundations, Applications, and Perspectives. Proceedings DLT’99 Word Scientific, Singapore (2000) 103–114
6. Mràz, F., Plàtek, M., Jančar P., Vogel, J.: Monotonic Rewriting Automata with a Restart Operation. In: Plàsil, F., Jeffery, K., J.: (eds.): SOFSEM’ 97. Theory and Practice of Informatics. F. Lecture Notes in Computer Science, Vol. 1338. Springer Verlag, Berlin Heidelberg New York (1997) 505–512
7. Plàtek, M., Mràz, F.: Degrees of (non)monotonocity of RRW-automata. In: Dassow, J., Wotschke, D. (eds): Pre-Proceedings of DCAGRS 2001, Dept. of Comp. Science, Otto-von-Guericke-University of Magdeburg, Germany (2001) 159–166
8. Rovan, B.: Complexity Classes of g-systems are AFL. Acta Mathematica Universitatis Comenianae, XLVIII -XLIX (1986) 283–297
9. Straňàkovà, M.: Selected Types of Pg-Ambiguity. The Prague Bulletin of Mathematical Linguistics 72 (1999) 29–82
10. S. H. von Solms. The characterization by automata of certain classes of languages in the context sensitive area. Information and Control (now Information and Computation) 27(3) (1975) 262–271