More Web Proxy on the site http://driver.im/

Article

Free access

Quasi-realtime languages (Extended Abstract)

Authors:

Ronald V. Book,

Sheila A. GreibachAuthors Info & Claims

STOC '69: Proceedings of the first annual ACM symposium on Theory of computing

Pages 15 - 18

https://doi.org/10.1145/800169.805416

Published: 05 May 1969 Publication History

Abstract

Quasi-realtime languages are the languages accepted by nondeterministic multitape Turing machines in real time. The family of quasi-realtime languages forms an abstract family of languages closed under intersection, linear erasing, and reversal. It is identical with the family of languages accepted by nondeterministic multitape Turing machines in linear time. Every quasi-realtime language can be accepted in real time by a non-deterministic one stack, one pushdown store machine, and can be expressed as the length-preserving homomorphic image of the intersection of three context-free languages.

References

[1]

R. Book, "Grammars with time functions," Ph.D. Thesis, Harvard University, 1969.

[2]

N. Chomsky and M.P. Schützenberger, "The algebraic theory of context-free languages," in Computer Programming and Formal Systems, North Holland, Amsterdam, 1963.

[3]

J. Evey, "The theory and application of push-down store machines," Ph.D. thesis, Harvard University, 1963. Also appears as Mathematical Linguistics and Automatic Translation, Report No. NSF-10, The Computation Laboratory, Harvard University, 1963.

[4]

M. Fischer, Private communication.

[5]

P.C. Fischer, "Turing machines with restricted memory access," Information and Control, 9 (1966), 364-379.

[6]

P.C. Fischer, A.R. Meyer, and A.L. Rosenberg, "Counter machines and counter languages," Math. Systems Theory, 2(1968), 265-283.

[7]

S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.

Digital Library

[8]

S. Ginsburg and S.A. Greibach, "Abstract families of languages," to appear as a Memoir of the American Mathematical Society.

[9]

S. Ginsburg and S.A. Greibach, "Multitape abstract families of automata," in preparation.

[10]

S. Ginsburg and S.A. Greibach, "Principal AFL" in preparation.

[11]

S. Ginsburg, S.A. Greibach, and M.A. Harrison "One-way stack automata," J.Assoc. Computing Mach., 14(1967), 389-418.

Digital Library

[12]

S. Ginsburg and M.A. Harrison, "One-way non-deterministic real-time list-storage languages," J. Assoc. Computing Mach., 15(1968), 428-446.

Digital Library

[13]

S. A. Greibach, "Inverses of phrase structure generators," Ph.D. thesis, Harvard University, 1963. Also appears as Mathematical Linguistics and Automatic Translation, Report NSF-11, The Computation Laboratory, Harvard University, 1963.

[14]

S. A. Greibach, "An infinite hierarchy of context-free languages," J. Assoc. Computing Mach., 16(1969), 91-106.

Digital Library

[15]

S. A. Greibach and J. E. Hopcroft, "Scattered context grammars," to appear in J. of Computer and Systems Science.

Digital Library

[16]

J. Hartmanis and R. E. Stearns, "On the computational complexity of algorithms," Trans. Amer. Math. Soc., 117(1965), 285-306.

[17]

J.E. Hopcroft and J.A. Ullman, "An approach to a unified theory of automata," Bell System Tech. J., 46(1967), 1793-1827.

[18]

A.R. Meyer, A.L. Rosenberg, and P.C. Fischer, "Multitape simulation of multihead Turing machines," IBM Research Report RC 1891, 15 August 1967.

[19]

A.L. Rosenberg, "Real-time definable languages," J. Assoc. Computing Mach., 14(1967), 645-662.

Digital Library

[20]

R. Book and S.A. Greibach, "Quasi-realtime languages," submitted for publication.

[21]

R. Book, "Grammars with linear time functions," Conference Record of IEEE Ninth Annual Symposium on Switching and Automata Theory, 1968.

Cited By

Makinde PEzeonye CEme C(2024)A Sociolinguistic Analysis of Traditional Marriage Terms in Awgbu-IgboJournal of Language and Linguistics in Society10.55529/jlls.44.41.51(41-51)Online publication date: 20-Jul-2024
https://doi.org/10.55529/jlls.44.41.51
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
Show More Cited By

Index Terms

Quasi-realtime languages (Extended Abstract)
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Algebraic language theory
    2. Grammars and context-free languages
  2. Models of computation
    1. Computability
      1. Turing machines

Recommendations

Alternation Elimination by Complementation (Extended Abstract)
LPAR '08: Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning

In this paper, we revisit constructions from the literature that translate alternating automata into language-equivalent nondeterministic automata. Such constructions are of practical interest in finite-state model checking, since formulas of widely ...
Intersections of linear context-free languages and reversal-bounded multipushdown machines (Extended Abstract)
STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing

The purpose of this paper is to establish the following result.

Theorem 3.1. Let L be a language. The following are equivalent:

(i) L is accepted by a nondeterministic multipushdown acceptor which operates in such a way that in every accepting ...
Extended Watson---Crick L systems with regular trigger languages and restricted derivation modes

Watson---Crick Lindenmayer systems add a control mechanism to ordinary Lindenmayer (L) system derivations. The mechanism is inspired by the complementarity relation in DNA strings, and it is formally defined in terms of a trigger language (trigger, for ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '69: Proceedings of the first annual ACM symposium on Theory of computing

May 1969

267 pages

ISBN:9781450374781

DOI:10.1145/800169

Copyright © 1969 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: 05 May 1969

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

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

4
Total Citations
View Citations
437
Total Downloads

Downloads (Last 12 months)60
Downloads (Last 6 weeks)5

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Makinde PEzeonye CEme C(2024)A Sociolinguistic Analysis of Traditional Marriage Terms in Awgbu-IgboJournal of Language and Linguistics in Society10.55529/jlls.44.41.51(41-51)Online publication date: 20-Jul-2024
https://doi.org/10.55529/jlls.44.41.51
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
Book RGreibach SWegbreit BFischer PFabian RUllman JKarp R(1970)Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)Proceedings of the second annual ACM symposium on Theory of computing10.1145/800161.805154(92-99)Online publication date: 4-May-1970
https://dl.acm.org/doi/10.1145/800161.805154

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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