Article

Free access

An iteration theorem for one-counter languages.

Author:

L. BoassonAuthors Info & Claims

STOC '71: Proceedings of the third annual ACM symposium on Theory of computing

Pages 116 - 120

https://doi.org/10.1145/800157.805043

Published: 03 May 1971 Publication History

PDF eReader

Abstract

We give a definition of one-counter languages. We show that the smallest full AFL containing this family is principal with full generator D'@@@@ @@@@, the semi-Dyck language on two letters. We then give without the proof, which shall be published elsewhere, our main result: an iteration theorem for one-counter languages that yields several corollaries.

References

[1]

BOASSON L. and M. NIVAT - Sur les Images par Transductions d'une Famille de Langages. (To Appear).

Google Scholar

[2]

EILENBERG. S. and M.P. SCHÜTZENBERGER - Rational Sets in Commutative Monoids. J. of Algebra 13 (1969), 173-191.

Google Scholar

[3]

ELGOT C.C. and J.E. MEZEI - On Relations Defined by Generalized Finite Automata. I.B.M. Jour. of Res. and Dev. 9 (1962), 47-68.

Digital Library

Google Scholar

[4]

GINSBURG S. - The Mathematical Theory of Context Free Languages. Mc GRAW-HILL (1966).

Digital Library

Google Scholar

[5]

GINSBURG S. and S. GREIBACH - Principal AFL. Jour. Comput. System Sciences 4 (1970), 308-338.

Digital Library

Google Scholar

[6]

GINSBURG S., S. GREIBACH and J. HOPCROFT - Studies in Abstract Families of Languages. Memoirs of the American Math. Soc. 87 (1969).

Google Scholar

[7]

GINSBURG S. and M. HARRISON - On the Closure of AFL under Reverseal. Information and Control 17 (1970), 395-409.

Crossref

Google Scholar

[8]

GREIBACH S. - An Infinite Hierarchy of Context Free Languages. JACM 16 (1969), 91-106.

Digital Library

Google Scholar

[9]

GREIBACH S. - Chains of Full AFL's. Math. System Theory 4 (1970), 231-242.

Crossref

Google Scholar

[10]

NIVAT M. - Transduction des Langages de Chomsky. Ann. Inst. Fourier, Grenoble, 18 (1968), 339-455.

Crossref

Google Scholar

[11]

OGDEN W. - A Helpful Result for Proving Inherent Ambiguity. Math. System Theory 2 (1967), 191-194.

Crossref

Google Scholar

Cited By

View all

Fernau HStiebe R(2011)On the expressive power of valences in cooperating distributed grammar systemsComputation, cooperation, and life10.5555/2017728.2017739(90-106)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2017728.2017739
Greibach S(1981)Formal LanguagesIEEE Annals of the History of Computing10.1109/MAHC.1981.100063:1(14-41)Online publication date: 1-Jan-1981
https://dl.acm.org/doi/10.1109/MAHC.1981.10006
Greibach S(1979)Formal languagesProceedings of the 20th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1979.19(66-90)Online publication date: 29-Oct-1979
https://dl.acm.org/doi/10.1109/SFCS.1979.19

Index Terms

An iteration theorem for one-counter languages.
1. Theory of computation
  1. Formal languages and automata theory
    1. Grammars and context-free languages

Recommendations

The complexity of regular abstractions of one-counter languages
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA) B that recognizes an abstraction of the language L(A): its (1) downward ...
Bisimulation equivalence and regularity for real-time one-counter automata

A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where stack emptiness can be tested; it is a real-time automaton if it contains no ε-transitions. We study the computational complexity of the problems of equivalence and ...
One-reversal counter machines and multihead automata: Revisited

We investigate the power of (1-reversal) counter machines (finite automata with multiple counters, where each counter can ''reverse'' only once, i.e., once a counter decrements, it can no longer increment) and one-way multihead finite automata (finite ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '71: Proceedings of the third annual ACM symposium on Theory of computing

May 1971

270 pages

ISBN:9781450374644

DOI:10.1145/800157

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 May 1971

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

STOC '71 Paper Acceptance Rate 23 of 50 submissions, 46%;

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

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
336
Total Downloads

Downloads (Last 12 months)65
Downloads (Last 6 weeks)20

Reflects downloads up to 23 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fernau HStiebe R(2011)On the expressive power of valences in cooperating distributed grammar systemsComputation, cooperation, and life10.5555/2017728.2017739(90-106)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2017728.2017739
Greibach S(1981)Formal LanguagesIEEE Annals of the History of Computing10.1109/MAHC.1981.100063:1(14-41)Online publication date: 1-Jan-1981
https://dl.acm.org/doi/10.1109/MAHC.1981.10006
Greibach S(1979)Formal languagesProceedings of the 20th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1979.19(66-90)Online publication date: 29-Oct-1979
https://dl.acm.org/doi/10.1109/SFCS.1979.19

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

The complexity of regular abstractions of one-counter languages

Bisimulation equivalence and regularity for real-time one-counter automata

One-reversal counter machines and multihead automata: Revisited