Deterministic Biautomata and Subclasses of Deterministic Linear Languages
We propose the notion of a deterministic biautomaton, a machine reading an input word from both ends. We focus on various subclasses of deterministic linear languages and give their characterizations by certain subclasses of deterministic biautomata. We use these characterizations to establish closure properties of the studied subclasses of languages and to get basic decidability results concerning them.
We would like to thank Professor Erkki Mäkkinen who proposed the topic of deterministic linear languages to us. We are also grateful to Libor Polák for useful discussions in the beginning of this research.
- 3.Bedregal, B.R.C.: Some subclasses of linear languages based on nondeterministic linear automata. Preprint (2016). http://arxiv.org/abs/1611.10276
- 7.Hoogeboom, H.J.: Undecidable problems for context-free grammars. Unpublished (2015). https://liacs.leidenuniv.nl/~hoogeboomhj/second/codingcomputations.pdf
- 10.Jakobi, S.: Modern Aspects of Classical Automata Theory: Finite Automata, Biautomata, and Lossy Compression. Logos Verlag, Berlin (2015)Google Scholar