Hierarchical relaxations of the correctness preserving property for restarting automata

Authors:
F. Mráz;F. Otto;M. Plátek
Affiliations:
Charles University, Faculty of Mathematics and Physics, Department of Computer Science, Praha 1, Czech Republic;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany;Charles University, Faculty of Mathematics and Physics, Department of Computer Science, Praha 1, Czech Republic
Venue:
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Year:
2007

Citing 4
Cited 1

Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Recent Advances in Formal Languages and Applications (Studies in Computational Intelligence)

Recent Advances in Formal Languages and Applications (Studies in Computational Intelligence)
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Correctness preservation and complexity of simple RL-automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

On lexicalized well-behaved restarting automata that are monotone

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A nondeterministic restarting automaton M is said to be (strongly) correctness preserving, if, for each cycle u ⊢Mc v, the word v belongs to the complete language LC(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 twodimensional hierarchy of classes of languages with membership problems that are decidable in polynomial time.