Recognizable set
id:
recognizable-set-309-10880964
title:
Recognizable set
text:
In computer science, more precisely in automata theory, a recognizable set of a monoid is a subset that can be distinguished by some homomorphism to a finite monoid. Recognizable sets are useful in automata theory, formal languages and algebra. This notion is different from the notion of recognizable language. Indeed, the term "recognizable" has a different meaning in computability theory.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Recognizable_set
date created:
date modified:
2024-03-01T23:14:45Z
main entity:
{"identifier":"Q4390247","url":"https://www.wikidata.org/entity/Q4390247"}
image:
fields total:
13
integrity:
13