Skip to main content
Log in

Minimization of the complexity function in the class of pushdown store automata and categorial grammars of complexity three

  • Published:
Algebra and Logic Aims and scope

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature cited

  1. Y. Bar-Hillel, C. Gaifman, and E. Shamir, "On categorial and phrase structure grammar," Bull. of the Research Council of Israel,9F, 1–16 (1960).

    Google Scholar 

  2. N. Chomsky, "Formal properties of grammars," in : R. R. Bush, E. H. Talanter, and R. D. Luce (editors), Handbook of Mathematical Psychology, Vol. 2, New York (1963).

  3. R. J. Evey, "The theory and applications of pushdown store machines," Mathematical Linguístics and Automatic Translation, No. NSF-10 (1963).

Download references

Authors

Additional information

Translated from Algebra i Logika, Vol. 7, No. 3, pp. 23–37, May–June, 1968.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dikovskii, A.Y., Modina, L.S. Minimization of the complexity function in the class of pushdown store automata and categorial grammars of complexity three. Algebr Logic 7, 144–152 (1968). https://doi.org/10.1007/BF02218596

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation