116 search results - page 2 / 24 » Operations Preserving Recognizable Languages |
DLT
2008
13 years 8 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
DLT
2003
13 years 8 months ago
2003
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...
DLT
2006
13 years 8 months ago
2006
Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
NMR
2004
Springer
14 years 9 days ago
2004
Springer
The action language A is a simple high-level language for describing transition systems. In this paper, we extend the action language A by allowing a unary modal operator in the u...