815 search results - page 1 / 163 » Algebraic Recognizability of Languages |
LATA
2009
Springer
13 years 11 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
FCT
1999
Springer
13 years 9 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
LFCS
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...