Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
In a recent paper, Dobronravov et al. (“On the length of shortest strings accepted by two-way finite automata”, DLT 2019) prove that the shortest string in a language recognized by an n-state two-way finite automaton (2DFA) can be at least symbols long, improved to in their latest contribution. The lower bound was obtained using “direction-determinate” 2DFA, which always remember their direction of motion at the last step, and used an alphabet of size In this paper, the method of Dobronravov et al. is extended to a new, more general class: the semi-direction-determinate 2DFA. This yields n-state 2DFA with shortest strings of length Furthermore, the construction is adapted to use a fixed alphabet, resulting in shortest strings of length It is also shown that an n-state semi-direction-determinate 2DFA can be transformed to a one-way NFA with states.
Original language | English |
---|---|
Title of host publication | Descriptional Complexity of Formal Systems - 22nd International Conference, 2020, Proceedings |
Editors | Galina Jirásková, Giovanni Pighizzini |
Publisher | Springer Nature |
Pages | 104-116 |
Number of pages | 13 |
ISBN (Print) | 9783030625351 |
DOIs | |
State | Published - 2020 |
Event | 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020 - Vienna, Austria Duration: 24 Aug 2020 → 26 Aug 2020 |
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 12442 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference | 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020 |
---|---|
Country/Territory | Austria |
City | Vienna |
Period | 24/08/20 → 26/08/20 |
ID: 72034528