On functional grammars

  • Leon Łukaszewicz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)


A family of simple relational systems — with a functional grammar as a parameter — can serve as a single framework for many theories of formal languages and automata. This note outlines the principles of the systems and comments their application.


Modular Form Formal Definition Formal Language Finite Automaton Lowercase Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    HOPCROFT, J.E. and ULLMAN, J.D. Formal Languages and their Relation to Automata Addison-Wesley Publishing Co., Reading, Massachusetts, 1969.Google Scholar
  2. [2]
    ŁUKASZEWICZ, L. Functional grammars — basic notions Bull. Acad. Polon. Sci., Cl.IV, 24, 12 (December 1976), 117–123.Google Scholar
  3. [3]
    Functional grammars Information Processing Letters, 6, 5 (October 1977), 146–150.Google Scholar
  4. [4]
    Introduction to Functional Grammars Reports of the Institute of Computer Science, P.A.S., Warsaw, successively to appear.Google Scholar
  5. [5]
    McCARTHY, J. et al. LISP 1.5 Programmer's Manual The M.I.T. Press, Cambridge, Massachusetts, 1962.Google Scholar
  6. [6]
    SUPPES, P. Introduction to Logic Van Nostrand, New York, N.Y. 1957.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Leon Łukaszewicz
    • 1
  1. 1.Institute of Computer SciencePolish Academy of Sciences PKiNWarsawPoland

Personalised recommendations