Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,253,417 papers from all fields of science
Search
Sign In
Create Free Account
Two-way deterministic finite automaton
Known as:
2NPDA
, 2DFA
, Two-way pushdown automaton
Expand
In computer science, in particular in automata theory, an automaton is called two-way if it is allowed to re-read its input.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Abstract machine
Automata theory
Computer science
Deterministic finite automaton
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Tropical Two-Way Automata Vincent Carnino , Sylvain Lombardy
Josep Díaz
,
Ivan Lanese
2017
Corpus ID: 39158431
In this paper we study two-way min-plus automata. We prove that two-way distance automata are equivalent to one-way distance…
Expand
2016
2016
Two-Way Automata in Coq Christian Doczkal Gert Smolka
C. Doczkal
,
Gert Smolka
2016
Corpus ID: 41858286
We formally verify translations from two-way automata to one-way automata based on results from the literature. Following Vardi…
Expand
2014
2014
Finding the Smallest Turing Machine Using k log ( n ) Non-deterministic Guesses
Michael Wehar
2014
Corpus ID: 17437282
Consider that we are given a number m and two disjoint finite sets of strings A and R. Does there exist a DFA with at most m…
Expand
2010
2010
Descriptional Complexity of Finite State Automata
Lubomíra Istonová
2010
Corpus ID: 16597961
This thesis is devoted to the descriptional complexity of finite state automata. We focus mainly on the transition complexity of…
Expand