Descriptional Complexity of Biautomata

Investor logo

Warning

This publication doesn't include Faculty of Education. It includes Faculty of Science. Official publication website can be found on muni.cz.
Authors

JIRÁSKOVÁ Galina KLÍMA Ondřej

Year of publication 2012
Type Article in Proceedings
Conference Descriptional Complexity of Formal Systems
MU Faculty or unit

Faculty of Science

Citation
Doi http://dx.doi.org/10.1007/978-3-642-31623-4_15
Field General mathematics
Keywords biautomata; descriptional complexity; minimal automaton
Description A biautomaton is a finite automaton which arbitrarily alternates between reading the input word from the left and from the right. Some compatibility assumptions in the formal definition of a biautomaton ensure that the acceptance of an input does not depend on the way how the input is read. The paper studies the constructions of biautomata from the descriptional point of view. It proves the tight bounds on the size of a biautomaton recognizing a regular language represented by a deterministic or nondeterministic automaton.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.