New Results on Semilinear Sets and Variants of Jumping Finite Automata by Simon
112,83 €
In formal language theory, the Parikh-image describes the absolute frequencies of symbols in words of a given language. A set is recognizable if and only if its syntactic monoid is finite.The first part of this monograph gives new results on semilinear sets.
Jetzt bei Ebay:
