Induction of regular languages
id:
induction-of-regular-languages-182-11197572
title:
Induction of regular languages
text:
In computational learning theory, induction of regular languages refers to the task of learning a formal description of a regular language from a given set of example strings. Although E. Mark Gold has shown that not every regular language can be learned this way, approaches have been investigated for a variety of subclasses. They are sketched in this article. For learning of more general grammars, see Grammar induction.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Induction_of_regular_languages
date created:
2013-11-24T19:21:13Z
date modified:
2024-09-06T09:13:16Z
main entity:
{"identifier":"Q17101592","url":"https://www.wikidata.org/entity/Q17101592"}
image:
fields total:
13
integrity:
14