255 search results - page 9 / 51 » jucs 2006 |
JUCS
2010
14 years 8 months ago
2010
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
JUCS
2010
14 years 8 months ago
2010
JUCS
2002
14 years 9 months ago
2002
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
JUCS
2002
14 years 9 months ago
2002
: Let b 2 be an integer. A real number is called simply normal to base b if in its representation to base b every digit appears with the same asymptotic frequency. We answer the f...
JUCS
2002
14 years 9 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...