Kleene's algorithm
id:
kleene-s-algorithm-292-6498036
title:
Kleene's algorithm
text:
In theoretical computer science, in particular in formal language theory, Kleene's algorithm transforms a given nondeterministic finite automaton (NFA) into a regular expression. Together with other conversion algorithms, it establishes the equivalence of several description formats for regular languages. Alternative presentations of the same method include the "elimination method" attributed to Brzozowski and McCluskey, the algorithm of McNaughton and Yamada, and the use of Arden's lemma.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Kleene%27s_algorithm
date created:
date modified:
2023-10-25T05:28:54Z
main entity:
{"identifier":"Q17102078","url":"https://www.wikidata.org/entity/Q17102078"}
image:
fields total:
13
integrity:
13