Skip to main content
Conference Proceedings

On the descriptional complexity of deterministic ordered restarting automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8614 LNCS 318-329
DOI: 10.1007/978-3-319-09704-6_28
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that the deterministic ordered restarting automaton is polynomially related in size to the weight-reducing Hennie machine. Accordingly, it allows very compact representations of (some) regular languages. In addition, we investigate the descriptional complexity of the operations of reversal, complementation, intersection, and union for regular languages that are given through stateless deterministic ordered restarting automata. © 2014 Springer International Publishing.

Author supplied keywords

Cite

CITATION STYLE

APA

Otto, F. (2014). On the descriptional complexity of deterministic ordered restarting automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 318–329). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free