Abstract
A nondeterministic restarting automaton M is said to be (strongly) correctness preserving, if, for each cycle \(u\vdash_M^c v\), the word v belongs to the complete language L C (M) accepted by M, if the word u does. Here, in order to differentiate between nondeterministic restarting automata that are correctness preserving and nondeterministic restarting automata in general we introduce two gradual relaxations of the correctness preserving property. These relaxations lead to an infinite two-dimensional hierarchy of classes of languages with membership problems that are decidable in polynomial time.
F. Mráz and M. Plátek were partially supported by the program ‘Information Society’ under project 1ET100300517. F. Mráz was also partially supported by the Grant Agency of Charles University in Prague under Grant-No. 358/2006/A-INF/MFF.
This is a preview of subscription content, log in via an institution to check access.
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
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)
Lopatkova, M., Platek, M., Sgall, P.: Towards a formal model for functional generative description - Analysis by reduction and restarting automata. The Prague Bulletin of Mathematical Linguistics 87, 7–26 (2007)
Messerschmidt, H., Mráz, F., Otto, F., Plátek, M.: Correctness preservation and complexity of simple RL-automata. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 162–172. Springer, Heidelberg (2006)
Messerschmidt, H., Otto, F.: On determinism versus nondeterminism for restarting automata. In: Loos, R., Fazekas, S.Z., Martin-Vide, C. (eds.) LATA 2007, Preproc. Report 35/07, Research Group on Math. Linguistics, Universitat Rovira i Virgili, Tarragona, 2007, pp. 413–424 (2007)
Mráz, F., Plátek, M., Jurdzinski, T.: Ambiguity by restarting automata. International Journal of Foundations of Computer Science (to appear)
Otto, F.: Restarting automata and their relations to the Chomsky hierarchy. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, Springer, Heidelberg (2003)
Otto, F.: Restarting automata. In: Ésik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mráz, F., Otto, F., Plátek, M. (2007). Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. In: Durand-Lose, J., Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74593-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-74593-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74592-1
Online ISBN: 978-3-540-74593-8
eBook Packages: Computer ScienceComputer Science (R0)