Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith  Home/Search
Context
Related
| flop.informatik.tumuenchen...d0l.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wwwbrauer.informatik.tumue...all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Languages de ned by iterated homomorphisms, i.e., D0L systems, are closely related to the arithmetic of small numbers. Based on this interrelation we improve the upper bound NC 1 on the complexity of the membership problem for D0L systems. We prove that the membership problem is contained in a proper subclass of AC 0 . This will show that the D0L languages are easier to recognize than the aperiodic regular languages. 1 Introduction We investigate languages de ned by iterated... (Update)
Similar documents (at the sentence level):
21.0%: Deterministic 0L Languages are of Very Low.. - Damm, Holzer, Lange, .. (Correct)
12.2%: Parallel Complexity of Iterated Morphisms and the.. - Damm, Holzer, Lange (1992) (Correct)
Active bibliography (related documents): More All
1.1: Deterministic 0L Languages are of Very Low.. - Damm, Holzer, Lange, .. (Correct)
0.8: Deterministic 0L Languages are of Very - Low Complexity Is (Correct)
0.2: Closure Properties of Ordered Languages - Fernau (Correct)
Similar documents based on text: More All
0.3: 4. GI Theorietag " Automaten und Formale Sprachen" - (ed.) (1995) (Correct)
0.3: Automata That Take Advice - Damm, Holzer (1995) (Correct)
0.3: Expressing Uniformity via Oracles - Damm, Holzer, Rossmanith (1997) (Correct)
BibTeX entry: (Update)
@misc{ damm-deterministic,
author = "Carsten Damm and Markus Holzer and Klaus-Jörn Lange and Peter Rossmanith",
title = "Deterministic 0L Languages are of Very Low Complexity: D0L is in AC 0",
url = "citeseer.ist.psu.edu/313448.html" }
Citations (may not include all citations):250 volume 2 of The Art of Computer Programming (context) - Knuth - 1969
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
125 On uniform circuit complexity (context) - Ruzzo - 1981
116 On uniformity within NC - Barrington, Immerman et al. - 1990
88 Approximate formulas for some functions of prime numbers (context) - Rosser, Schoenfeld - 1962
48 Borel sets and circuit complexity (context) - Sipser - 1983
45 Parity circuits and the polynomial-time hierarchy (context) - Furst, Saxe et al. - 1981
6 volume 90 of Pure and Applied Mathematics (context) - Rozenberg, Salomaa et al. - 1980
5 The time and tape complexity of developmental languages (context) - Sudborough - 1977
5 The parallel complexity of iterated morphisms and the arithm.. - Damm, Holzer et al. - 1992
4 membership problem ETL language is polynomially complete (context) - membership, ET et al. - 1975
4 Recognition deterministic ETL language logarithmic space (context) - Skyum, deterministic et al. - 1977
Documents on the same site (http://wwwbrauer.informatik.tu-muenchen.de/gruppen/theorie/publications/all.html): More
Analysing Input/Output-Capabilities of Mobile Processes with a.. - König (Correct)
New Worst-Case Upper Bounds for MAX-2-SAT with.. - Gramm, Hirsch.. (2000) (Correct)
A Graph Rewriting Semantics for the Polyadic π-Calculus.. - König (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC