Tagged Deterministic Finite Automaton
id:
tagged-deterministic-finite-automaton-253-7404533
title:
Tagged Deterministic Finite Automaton
text:
In the automata theory, a tagged deterministic finite automaton (TDFA) is an extension of deterministic finite automaton (DFA). In addition to solving the recognition problem for regular languages, TDFA is also capable of submatch extraction and parsing. While canonical DFA can find out if a string belongs to the language defined by a regular expression, TDFA can also extract substrings that match specific subexpressions. More generally, TDFA can identify positions in the input string that match
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Tagged_Deterministic_Finite_Automaton
date created:
date modified:
2023-08-13T05:23:07Z
main entity:
{"identifier":"Q112649318","url":"https://www.wikidata.org/entity/Q112649318"}
image:
fields total:
13
integrity:
13