217 search results - page 8 / 44 » Circuit Complexity of Regular Languages |
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
MFCS
2005
Springer
14 years 29 days ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
MST
2006
13 years 7 months ago
2006
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...