Skip to main content
SpringerLink
Log in

Breadth-first phrase structure grammars and queue automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ayers K., "Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages". Theor.Comp.Sci. 40 (1985), 163–174.

    Google Scholar 

  2. Branienburg F.J., "Multiple equality sets and Post machines", J.Comput.System Sci., 21, 1980, 293–316.

    Google Scholar 

  3. Brandenburg F.J., "Intersections of some families of languages", Proc 13 ICALP, Lecture Notes in Computer Science 226, 1986, 61–68.

    Google Scholar 

  4. Cherubini A., Citrini C. and Mandrioli D. Quasi Real Time FIFO automata, Rapp. int. n. 87035, Dip. Elettronica, Politecnico di Milano, 1987.

    Google Scholar 

  5. Salomaa A, Formal Languages, Academic Press, 1973.

    Google Scholar 

  6. Yauquelin B., Franchi Zannettacci P., "Automates a file". Theoretical Comp. Sci., 11, 1980, 221–225

    Google Scholar 

  7. Yollmar P., "Ueber einen Automaten mit Pufferspeicherung", Computing 5 (1970), 57–70.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Piazza Leonardo da Vinci 32, 20133, Milano, Italy

    A. Cherubini

  2. Dipartimento di Elettronica Politecnico, Piazza Leonardo de Vinci 32, 20133, Milano, Italy

    S. Crespi Reghizzi

Authors
  1. E. Allevi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Cherubini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Crespi Reghizzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Allevi, E., Cherubini, A., Reghizzi, S.C. (1988). Breadth-first phrase structure grammars and queue automata. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017139

Download citation

  • DOI: https://doi.org/10.1007/BFb0017139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation