Article

Free access

Properties that characterize LOGCFL

Author:

H. VenkateswaranAuthors Info & Claims

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

Pages 141 - 150

https://doi.org/10.1145/28395.28411

Published: 01 January 1987 Publication History

Abstract

Two properties, called semi-unboundedness, and polynomial proof-size, are identified as key properties shared by the definitions of LOGCFL on several models of computations. The semi-unboundedness property leads to the definition of new models of computation based on unbounded fan-in circuits. These are circuits obtained from unbounded fan-in circuits by restricting the fan-in of gates of one type. A new characterization of LOGCFL is obtained on such a model in which the fan-in of the AND gates are bounded by a constant. This property also suggests new characterizations of LOGCFL on the following models: alternating Turing machines [CKS81], nondeterministic auxiliary pushdown automata [Co71], and bounded fan-in Boolean circuits [Co85].

References

[1]

Borodin, A., On Relating Time and Space to Size and Depth, SIAM J. Computing 6, (1977), ?33-743.

[2]

Chandra, A.K., D.C. Kozen, and L.J. Stockmeyer, Alternation, JACM 28, (1981), I14- 133.

Digital Library

[3]

Cook, S.A., Path Systems and Language Recognition, Pro~. 2nd STOC (1970), 70-72.

Digital Library

[4]

Cook, S.A., Characterizations of Pushdown machines in ternls of Time-bounded Computers, JACM18, 1 (Jan 1971), 4-18.

Digital Library

[5]

Cook, S.A., A Taxonomy of Problems with Fast Parallel Algorithms, Information arid Control 64, 1-3 (jan/Feb/Max 1985), 2-22.

Digital Library

[6]

Dahlhaus, E. and M.K. Warmuth:, Membership for GrowiiJg Context-Sensitive Grammars is Polynmuial, JC$$ 33, (1986), 456- 472.

Digital Library

[7]

Dymond, P.W. and W.L. Ruzzo, Parallel RAMs with Owned Global Memory ~nd Deterministic Context-Free Language Recognition, ICALP proceeding~ (1986).

Digital Library

[8]

Engeffriet, J., The Complexity of Languages Generated by A~ribute Grammars, ;~IAM J. Computing 15, (Feb 1986):, 70-86.

Digital Library

[9]

Goldschlager, L.M., The Monotone arid Planar Circuit Value Problems are log space Comphte for P, $IGACT News 9, 2, 1977, 25-29

Digital Library

[10]

Immerman, N., Upper and Lower Bounds for First Order Expressibllty, JOSS 25, (1982), 76-98.

[11]

Ladner, R.E., R.J. Lipton, and L.J. Stockmeyer, Alternating Pushdown arid Stack Automata, SIAM J. Oomputing 15, (Feb 1984), 135-155.

[12]

Lewis, P.M., R.E. Stearns, and J. Hartmanis, Memory Bounds for Recognition of Context-free and Context Sensitive Laaguagea, Proe. IEEE 6th Anaual Symposium on Switching Theory a~d Logic Design, 1965, 191-202.

[13]

Razzo, W.L., Tree-Size Bounded Alternation, JESS' 20, (1980), 218-235.

[14]

Ru,zo, W.L., On Uniform Circuit Complexity, JCSS 22, (1981), 365-383.

[15]

Skyum, $., L.G. Valiant, A Complexity Theory Based on Boolean Algebra, JACM 82, (1985), 484-502.

Digital Library

[16]

Sudborough, I.H., Time and Tape Bounded Auxiliary Pushdown Automata, Mathematical Foundations of Computer Science, (1977), 493-503.

[17]

Sudborough, i.H., The Complexity of the Membership Problem for some Extensions of Context-Free Languages, lnternat. J. Cornput. Math. A 6, (1977), 191-215.

[18]

Sudborough, I.H., On the Tape Complexity of Deterministic Context-free languages, JACM 25, 3(1978), 405-414.

Digital Library

[19]

Stockmeyer, L. and U. Vishkin, Simula. tion of Parallel Random Access Machines by Circuits, SiAM Journal of Oomputin9 lS, (1984), 409-422. Stanford Univ. Report, (Dec 1985).

[20]

Venkateswaran, H. and M. Tompa, A New Pebble Game that Chaxacterises Parallel Complexity Classes, Proc. e7th Annual $ympoMum on Foundations of Computer Science, Toronto, 1986.

Cited By

Lange K(2019)COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORYFundamenta Informaticae10.5555/2379510.237951825:3,4(327-352)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2379510.2379518
Lautemann C(2019)The complexity of graph languages generated by hyperedge replacementActa Informatica10.1007/BF0028901727:5(399-421)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1007/BF00289017
Bourreau PKallmeyer LSalvati S(2013)On IO-Copying and Mildly-Context Sensitive FormalismsFormal Grammar10.1007/978-3-642-39998-5_1(1-16)Online publication date: 2013
https://doi.org/10.1007/978-3-642-39998-5_1
Show More Cited By

Index Terms

Properties that characterize LOGCFL

Recommendations

Properties of wired logic
The MIT Press scientific computation series

When we design networks with NOR or NAND gates which are implemented with bipolar and MOS transistors, wired logic is usually allowed. The usage of wired logic reduces the network cost and possibly improves the speed because of shorter delays on wired ...
Properties of visibly pushdown transducers
MFCS'10: Proceedings of the 35th international conference on Mathematical foundations of computer science

Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. It has been shown that visibly ...
The Descriptive Complexity Approach to LOGCFL

Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

January 1987

471 pages

ISBN:0897912217

DOI:10.1145/28395

Editor:
Alfred V. Aho

Copyright © 1987 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC87

Sponsor:

SIGACT

STOC87: 19th Annual ACM Conference on Theory of Computing

New York, New York, USA

Acceptance Rates

STOC '87 Paper Acceptance Rate 50 of 165 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
455
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)11

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lange K(2019)COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORYFundamenta Informaticae10.5555/2379510.237951825:3,4(327-352)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.5555/2379510.2379518
Lautemann C(2019)The complexity of graph languages generated by hyperedge replacementActa Informatica10.1007/BF0028901727:5(399-421)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1007/BF00289017
Bourreau PKallmeyer LSalvati S(2013)On IO-Copying and Mildly-Context Sensitive FormalismsFormal Grammar10.1007/978-3-642-39998-5_1(1-16)Online publication date: 2013
https://doi.org/10.1007/978-3-642-39998-5_1
Fernau HLange KReinhardt K(2005)Advocating ownershipFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-62034-6_57(286-297)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-62034-6_57
Caussinus HLemieux F(2005)The complexity of computing over quasigroupsFoundation of Software Technology and Theoretical Computer Science10.1007/3-540-58715-2_112(36-47)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-58715-2_112
Lange KReinhardt K(2005)Empty alternationMathematical Foundations of Computer Science 199410.1007/3-540-58338-6_96(494-503)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-58338-6_96
Venkateswaran H(2005)Circuit definitions of nondeterministic complexity classesFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-50517-2_80(175-192)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-50517-2_80
Lautemann C(2005)Efficient algorithms on context-free graph languagesAutomata, Languages and Programming10.1007/3-540-19488-6_128(362-378)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-19488-6_128
Reischuk KReischuk K(1999)Sequentielle KomplexitätsklassenKomplexitätstheorie Band I: Grundlagen10.1007/978-3-322-80139-5_6(275-339)Online publication date: 1999
https://doi.org/10.1007/978-3-322-80139-5_6
Gal A(1995)Semi-unbounded fan-in circuits: Boolean vs. arithmeticProceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference10.1109/SCT.1995.514730(82-87)Online publication date: 1995
https://doi.org/10.1109/SCT.1995.514730
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents