Posts classified under: Amacc

A classical result from the theory of formal languages, the Myhill-Nerode theorem, gives a necessary and sufficient condition in terms of congruence classes for a language to be regular. In … Continue reading Séminaire Algorithmique : « Computability of extender sets in multidimensional subshifts », Léo Paviet Salomon (GREYC, Caen)