Neue Ergebnisse zu semilinearen Sets und Varianten springender endlicher Automaten von Simon
112,24 €
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:
![Produktbild - Finite Automata by Lawson, Mark V. [Hardback]](https://i.ebayimg.com/thumbs/images/g/cbgAAeSwnTJoTUFz/s-l140.jpg)
![Produktbild - Finite Automata by Lawson, Mark V. [Paperback]](https://i.ebayimg.com/thumbs/images/g/sisAAeSwxvVoS5EC/s-l140.jpg)
