On functional grammars
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.
KeywordsModular Form Formal Definition Formal Language Finite Automaton Lowercase Letter
Unable to display preview. Download preview PDF.
- HOPCROFT, J.E. and ULLMAN, J.D. Formal Languages and their Relation to Automata Addison-Wesley Publishing Co., Reading, Massachusetts, 1969.Google Scholar
- ŁUKASZEWICZ, L. Functional grammars — basic notions Bull. Acad. Polon. Sci., Cl.IV, 24, 12 (December 1976), 117–123.Google Scholar
- — Functional grammars Information Processing Letters, 6, 5 (October 1977), 146–150.Google Scholar
- — Introduction to Functional Grammars Reports of the Institute of Computer Science, P.A.S., Warsaw, successively to appear.Google Scholar
- McCARTHY, J. et al. LISP 1.5 Programmer's Manual The M.I.T. Press, Cambridge, Massachusetts, 1962.Google Scholar
- SUPPES, P. Introduction to Logic Van Nostrand, New York, N.Y. 1957.Google Scholar