7 search results - page 1 / 2 » A Hierarchy Theorem for Regular Languages over Free Bisemigr... |
ACTAC
2004
13 years 6 months ago
2004
STACS
2001
Springer
13 years 11 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
DIAGRAMS
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
LATA
2009
Springer
14 years 1 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...
POPL
2004
ACM
14 years 6 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...