| 1. |
- Bensch, Suna, et al.
(författare)
-
Information, codes and languages : Essays dedicated to Helmut Jürgensen on the occassion of his 75th birthday – Preface
- 2018. - 23
-
Ingår i: Journal of Automata, Languages and Combinatorics. - Giessen : Institut für Informatik, Justus-Liebig-Universität Giessen. - 1430-189X .- 2567-3785. ; 23:1–3, s. 3-4
-
Tidskriftsartikel (refereegranskat)abstract
- This special issue is dedicated to Professor Helmut Jürgensen on the occasion of his 75th birthday and in appreciation of his scientific work and his impact as teacher, mentor, and person. The sixteen papers in this special issue were submitted by invitation of the guest editors. Each paper was reviewed by at least two referees. The authors of the papers in this special issue are collaborators, co-authors, or scientific descendents of Helmut Jürgensen.
|
|
| 2. |
- Bensch, Suna, et al.
(författare)
-
On input-revolving deterministic and nondeterministic finite automata
- 2009
-
Ingår i: Information and Computation. - 0890-5401 .- 1090-2651. ; 207, s. 1140-1155
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce and investigate input-revolving finite automata, which are (nondeterministic) finite state automata with additional ability to shift the remaining part of the input. Three different modes of shifting are considered, namely revolving to the left, revolving to the right, and circular-interchanging. We investigate the computational capacities of these three types of automata and their deterministic variants, comparing any of the six classes of automata with each other and with further classes of well-known automata. In particular, it is shown that nondeterminism is better than determinism, that is, for all three modes of shifting there is a language accepted by the nondeterministic model but not accepted by any determinstic automaton of the same type. Concerning the closure properties most of the deterministic language families studied are not closed under standard operations. For example, we show that the family of languages accepted by deterministic right-revolving finite automata is an anti-AFL which is not closed under reversal and intersection.
|
|
