Two-way finite automaton
id:
two-way-finite-automaton-282-7642544
title:
Two-way finite automaton
text:
In computer science, in particular in automata theory, a two-way finite automaton is a finite automaton that is allowed to re-read its input.
brand slug:
wiki
category slug:
encyclopedia
description:
Type of finite automaton in automata theory
original url:
https://en.wikipedia.org/wiki/Two-way_finite_automaton
date created:
date modified:
2023-12-02T23:11:28Z
main entity:
{"identifier":"Q243800","url":"https://www.wikidata.org/entity/Q243800"}
image:
fields total:
13
integrity:
14