4 search results - page 1 / 1 » Polynomial Closure and Unambiguous Product |
63
Voted
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
DLT
2006
14 years 10 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...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
MFCS
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...