815 search results - page 3 / 163 » Algebraic Recognizability of Languages |
CORR
1999
Springer
13 years 5 months ago
1999
Springer
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds,scalar fields, tensors, and the like, but these algebraic structures a...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
SEFM
2006
IEEE
13 years 11 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We provide a complete description of the Wadge hierarchy for deterministically recognizable sets of infinite trees. In particular we give an elementary procedure to decid...
DLT
2008
13 years 7 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 ...