We investigate the descriptional complexity of nondeterministic biautomata, which are a generalization of biautomata [O. Klíma, L. Polák: On biautomata.

We investigate the descriptional complexity of nondeterministic biautomata, which are a generalization of biautomata [O. KLÍMA, L. POLÁK: On biautomata.

Biautomata were recently introduced in [4] as a generalization of ordinary deterministic finite automata. A biautomaton consists of a deterministic finite.

Nondeterministic Biautomata and Their. Descriptional Complexity. Markus Holzer and Sebastian Jakobi. Institut für Informatik. Justus-Liebig-Universität.

Abstract. We investigate the descriptional complexity of nondetermin- istic biautomata, which are a generalization of biautomata [O. Klıma,.

It turns out that as in the case of ordinary finite automata nondeterministic biautomata are superior to biaUTomata with respect to their relative ...

Abstract: We investigate the descriptional complexity of nondeterministic biautomata, which are a generalization of biautomata [O. KLÍMA, ...

We investigate the descriptional complexity of nondeterministic biautomata, which are a generalization of biautomata [O. Klíma, L. Polák: On biautomata.

We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a ...

A biautomaton is a finite automaton which arbitrarily alternates between reading the input word from the left and from the right.