3 citations · 8 across the 9 of their papers we have counts for
1 paper · 2 filters
Lukas Fleischer, Manfred Kufleitner
Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model wh…