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.
This research was partially supported by the Deutsche Forschungsgemeinschaft, SFB 324
Preview
Unable to display preview. Download preview PDF.
References
A. K. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J. ACM, 28:114–133, 1981.
S. A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. J. ACM, 18:4–18, 1971.
S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inform. and Control, 64:2–22, 1985.
P. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th ICALP, number 226 in LNCS, pages 95–104. Springer, 1987.
K.-J. Lange. Unambiguity of circuits. To appear in Proc. of Structure in Complexity Conf., 1990.
W. L. Ruzzo. On uniform circuit complexity. J. Comput. Syst. Sci., 22:365–338, 1981.
W. L. Ruzzo. Tree-size bounded alternation. J. Comput. Syst. Sci., 21:218–235, 1980.
W. Rytter. Parallel time O(log n) recognition of unambiguous context-free languages. Inform. and Comp., 73:75–86, 1987.
L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2):409–422, May 1984.
H. Venkateswaran. Properties that characterize LOGCFL. In Proc. of 19th STOC, pages 141–150, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lange, KJ., Rossmanith, P. (1990). Characterizing unambiguous augmented pushdown automata by circuits. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029635
Download citation
DOI: https://doi.org/10.1007/BFb0029635
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive