Automata by Circuits Klaus-Jorn Lange Peter Rossmanith Institut fur...  Home/Search
Context
Related
| lti.informatik.rwthaachen.de...urac.ps 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: lti.informatik....lications.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The notions of weak and strong unambiguity of augmented push-down automata are considered and related to unambiguities of circuits. In particular we exhibit circuit classes exactly characterizing polynomially time bounded unambiguous augmented push-down automata. (Update)
Active bibliography (related documents): More All
0.3: Characterizing Unambiguous Augmented Pushdown Automata by.. - Lange, Rossmanith (1990) (Correct)
0.3: Unambiguous Simulations of Auxiliary Pushdown Automata and .. - Niedermeier, Rossmanith (1992) (Correct)
0.3: Unambiguous Simulations of Auxiliary Pushdown Automata - And Circuits Preliminary (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ circuits-characterizing,
author = "Automata By Circuits",
title = "Characterizing Unambiguous Augmented Pushdown",
url = "citeseer.ist.psu.edu/749038.html" }
Citations (may not include all citations):168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985 ACM DBLP
125 On uniform circuit complexity (context) - Ruzzo - 1981 DBLP
49 Tree-size bounded alternation (context) - Ruzzo - 1980 DBLP
41 Properties that characterize LOGCFL (context) - Venkateswaran - 1987 ACM DBLP
39 Characterizations of pushdown machines in terms of time-boun.. (context) - Cook - 1971 ACM DBLP
38 Simulation of parallel random access machines by circuits (context) - Stockmeyer, Vishkin - 1984 DBLP
23 Parallel RAMs with owned global memory and deterministic lan.. - Dymond, Ruzzo - 1987
12 Unambiguity of circuits (context) - Lange - 1990 ACM DBLP
10 recognition of unambiguous context-free languages (context) - Rytter, log - 1987
Documents on the same site (http://www-lti.informatik.rwth-aachen.de/pub/publications.shtml): More
New Upper Bounds for Maximum Satisfiability - Niedermeier, Rossmanith (2000) (Correct)
k-Variable Pattern Languages Efficiently Stochastically.. - Rossmanith, Zeugmann (1998) (Correct)
A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (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