{"version":"1.0","type":"link","title":"Recognizable set - Newikis","description":"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.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}