815 search results - page 7 / 163 » Algebraic Recognizability of Languages |
FORMATS
2009
Springer
15 years 4 months ago
2009
Springer
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
IJCM
2010
14 years 8 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang system...
ENTCS
2010
14 years 6 months ago
2010
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...