Skip to main content
Springer Nature Link
Log in

On two subclasses of real-time grammars

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

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

  • 122 Accesses

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. Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vols. I,II, Prentice Hall, Englewood Cliffs (1972–3).

    Google Scholar 

  2. Friedman, E.P., The inclusion problem for simple languages, Theoret. Comput. Sci. 1 (1976) pp. 297–316.

    Article  Google Scholar 

  3. Friedman, E.P., Equivalence problems for deterministic context-free languages and monadic recursion schemes, J. Comput. Syst. Sci. 14 (1977) pp. 344–359.

    Google Scholar 

  4. Geller, M.M., Harrison, M.A., Havel, I.M., Normal forms of deterministic grammars, Discrete Mathematics 16 (1976) pp. 313–322.

    Article  Google Scholar 

  5. Greibach, S.A., A new normal form theorem for context-free phrase structure grammars, J.ACM 12 (1965) pp. 42–52.

    Article  Google Scholar 

  6. Harrison, M.A., Havel, I.M., Strict deterministic grammars, J. Comput. Syst. Sci. 7 (1973) pp. 237–277.

    Google Scholar 

  7. Harrison, M.A., Havel, I.M., On the parsing of deterministic languages, J.ACM 21 (1974) pp. 525–548.

    Article  Google Scholar 

  8. Harrison, M.A., Havel, I.M., Real-time strict deterministic languages, SIAM J. on Computing 1 (1972) pp. 333–349.

    Article  Google Scholar 

  9. Korenjak, A.J., Hopcroft, J.E., Simple deterministic languages, IEEE Conf. Record of 7th Annual Symp. on Switching and Automata Theory, Berkeley (1966) pp. 36–46.

    Google Scholar 

  10. Linna, M., Two decidability results for deterministic pushdown automata, in Mathematical Foundations of Computer Science 1977, LNCS 53, Springer-Verlag, Berlin (1977) pp. 363–373.

    Google Scholar 

  11. Penttonen, M., The decidability of the equivalence problem for real-time strict deterministic pushdown automata, Bulletin of the EATCS, No. 4, January 1978, pp. 26–29.

    Google Scholar 

  12. Pittl, J., Exponential optimization for the LLP(k) parsing method, in Mathematical Foundations of Computer Science 1977, LNCS 53, Springer-Verlag, Berlin (1977) pp. 435–442.

    Google Scholar 

  13. Rosenkrantz, D.J., Stearns, R.E., Properties of deterministic topdown grammars, Information and Control 17 (1970) pp. 226–256.

    Article  Google Scholar 

  14. Valiant, L.G., Decision Problems for Families of Deterministic Pushdown Automata, University of Warwick Computer Centre, Report No. 7 (1973).

    Google Scholar 

  15. Taniguchi, K., Tokura, N., Kasami, T., A subclass of deterministic context-free languages, Systems, Computers & Controls 1 (1970) pp. 10–16.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Charles University, Prague, Czechoslovakia

    Jan Pittl

Authors
  1. Jan Pittl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pittl, J. (1978). On two subclasses of real-time grammars. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics