Generalized nondeterministic finite automaton
id:
generalized-nondeterministic-finite-automaton-172-6538588
title:
Generalized nondeterministic finite automaton
text:
In the theory of computation, a generalized nondeterministic finite automaton (GNFA), also known as an expression automaton or a generalized nondeterministic finite state machine, is a variation of a nondeterministic finite automaton (NFA) where each transition is labeled with any regular expression. The GNFA reads blocks of symbols from the input which constitute a string as defined by the regular expression on the transition. There are several differences between a standard finite state machin
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Generalized_nondeterministic_finite_automaton
date created:
2004-05-14T06:27:53Z
date modified:
2024-09-01T19:07:48Z
main entity:
{"identifier":"Q5532499","url":"https://www.wikidata.org/entity/Q5532499"}
image:
fields total:
13
integrity:
14