article

Free access

Programming languages capturing complexity classes

Author:

Martin HofmannAuthors Info & Claims

ACM SIGACT News, Volume 31, Issue 1

Pages 31 - 42

https://doi.org/10.1145/346048.346051

Published: 01 March 2000 Publication History

PDF eReader

Cited By

View all

BHASKAR SSIMONSEN J(2023)Read/write factorizable programsJournal of Functional Programming10.1017/S095679682300002333Online publication date: 8-Jun-2023
https://doi.org/10.1017/S0956796823000023
Dal Lago U(2022)Implicit computation complexity in higher-order programming languagesMathematical Structures in Computer Science10.1017/S0960129521000505(1-17)Online publication date: 15-Mar-2022
https://doi.org/10.1017/S0960129521000505
Hoffmann JJost S(2022)Two decades of automatic amortized resource analysisMathematical Structures in Computer Science10.1017/S096012952100048732:6(729-759)Online publication date: 16-Mar-2022
https://doi.org/10.1017/S0960129521000487
Show More Cited By

Index Terms

Programming languages capturing complexity classes
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Data types and structures
2. Theory of computation
  1. Formal languages and automata theory
    1. Grammars and context-free languages
  2. Semantics and reasoning
    1. Program semantics

Recommendations

Iterated pushdown automata and complexity classes
STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing

An iterated pushdown is a pushdown of pushdowns of ... of pushdowns. An iterated exponential function is 2 to the 2 to the ... to the 2 to some polynomial. The main result is that nondeterministic 2-way and multi-head iterated pushdown automata ...
On tape-bounded complexity classes and multihead finite automata

The principal result described in this paper is the equivalence of the following statements:o(1)Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a deterministic two-way k-head finite automaton, for some k. (2)...
The complexity of finite languages

Comments

Information & Contributors

Information

Published In

ACM SIGACT News Volume 31, Issue 1

March 2000

65 pages

ISSN:0163-5700

DOI:10.1145/346048

Editor:
Ian Parberry
Univ. of North Texas, Denton

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 2000

Published in SIGACT Volume 31, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
401
Total Downloads

Downloads (Last 12 months)62
Downloads (Last 6 weeks)8

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

BHASKAR SSIMONSEN J(2023)Read/write factorizable programsJournal of Functional Programming10.1017/S095679682300002333Online publication date: 8-Jun-2023
https://doi.org/10.1017/S0956796823000023
Dal Lago U(2022)Implicit computation complexity in higher-order programming languagesMathematical Structures in Computer Science10.1017/S0960129521000505(1-17)Online publication date: 15-Mar-2022
https://doi.org/10.1017/S0960129521000505
Hoffmann JJost S(2022)Two decades of automatic amortized resource analysisMathematical Structures in Computer Science10.1017/S096012952100048732:6(729-759)Online publication date: 16-Mar-2022
https://doi.org/10.1017/S0960129521000487
Gaboardi MPéchoux R(2015)Algebras and coalgebras in the light affine Lambda calculusACM SIGPLAN Notices10.1145/2858949.278475950:9(114-126)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784759
Gaboardi MPéchoux RFisher KReppy J(2015)Algebras and coalgebras in the light affine Lambda calculusProceedings of the 20th ACM SIGPLAN International Conference on Functional Programming10.1145/2784731.2784759(114-126)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2784731.2784759
(2015)Realizability models for a linear dependent PCFTheoretical Computer Science10.1016/j.tcs.2015.03.005585:C(55-70)Online publication date: 20-Jun-2015
https://dl.acm.org/doi/10.1016/j.tcs.2015.03.005
Grohe M(2015)Logical Characterizations of Complexity ClassesEncyclopedia of Applied and Computational Mathematics10.1007/978-3-540-70529-1_201(830-834)Online publication date: 21-Nov-2015
https://doi.org/10.1007/978-3-540-70529-1_201
Wang D(2014)MAHJONG AND URBAN LIFE: INDIVIDUAL RIGHTS, COLLECTIVE INTERESTS, AND CITY IMAGE IN POST-MAO CHINAInternational Journal of Asian Studies10.1017/S147959141400016311:2(187-210)Online publication date: 8-Jul-2014
https://doi.org/10.1017/S1479591414000163
Dal Lago UGaboardi M(2011)Linear Dependent Types and Relative CompletenessProceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science10.1109/LICS.2011.22(133-142)Online publication date: 21-Jun-2011
https://dl.acm.org/doi/10.1109/LICS.2011.22
Marion JPéchoux R(2008)A characterization of NCk by first order functional programsProceedings of the 5th international conference on Theory and applications of models of computation10.5555/1791834.1791849(136-147)Online publication date: 25-Apr-2008
https://dl.acm.org/doi/10.5555/1791834.1791849
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Iterated pushdown automata and complexity classes

On tape-bounded complexity classes and multihead finite automata

The complexity of finite languages

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations