Glushkov's construction algorithm
id:
glushkov-s-construction-algorithm-234-6590240
title:
Glushkov's construction algorithm
text:
In computer science theory – particularly formal language theory – Glushkov's construction algorithm, invented by Victor Mikhailovich Glushkov, transforms a given regular expression into an equivalent nondeterministic finite automaton (NFA). Thus, it forms a bridge between regular expressions and nondeterministic finite automata: two abstract representations of the same class of formal languages. A regular expression may be used to conveniently describe an advanced search pattern in a "find and
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Glushkov%27s_construction_algorithm
date created:
date modified:
2023-12-03T11:02:29Z
main entity:
{"identifier":"Q827139","url":"https://www.wikidata.org/entity/Q827139"}
image:
fields total:
13
integrity:
13