Introduction to Formal Languages, McGraw-Hill Computer Science Series, 1983. (Reprinted by DOVER Publications, Inc., New York, 1991.)
Lambda-Calculus, Combinators, and Functional Programming, Cambridge Tracts in Theoretical Computer Science 4, Cambridge University Press, 1988.
Categorical Combinators with Explicit Products, Fundamenta Informaticae, special issue on "Categories in Computer Science", Vol. 22, No. 1,2 (Jan. - Feb. 1995), pp. 153-166.
A list oriented extension of the lambda-calculus satisfying the Church - Rosser theorem, Theoretical Computer Science, Vol. 93, issue 1, (February 1992), pp. 75-89.
On translating ordinary mathematical notation, Structured Programming, Vol. 12, No. 3, (September 1991), pp. 115-122.
Comparing two functional programming systems, (with B. Hailpern and T. Huynh), IEEE Transactions on Software Engineering, Vol. 15, No. 5, (May 1989), pp. 532-542.
Axioms for the theory of lambda-conversion, SIAM Journal on Computing, Vol. 14, No. 2, (May 1985), pp. 373 - 382.
A note on macro generation, Software - Practice and Experience, Vol. 15, No. 5, (May 1985), pp. 423-426.
An extension of the lambda-calculus for functional programming, Journal of Logic Programming, Vol. 1, No. 3, (October 1984), pp. 241-251.
An efficient procedure for finding normal forms of lambda-terms, (with M. Soós) SMIL Journal of Linguistic Calculus, 1980, No. 3, pp. 51-62.
Algebraic properties of derivation words, Journal of Computer and System Sciences, Vol 15, No. 2, (1977) pp. 232-240.
Multicontrol Turing machines, Acta Cybernetica, Tom. 3, Fasc. 2 (1977), pp. 173-177.
A note on the relation of Turing machines to phrase structure grammars, Computational Linguistics and Computer Languages, Vol. XI (1976), pp. 11-16.
On phrase structure grammars and two-pushdown automata (in Hungarian), Alkalmazott Matematikai Lapok, Vol. 1, No. 3-4 (1975), pp. 397-404.
Comment on the paper 'Error detection in formal languages', Journal of Computer and System Sciences, Vol. 8, No. 2 (1974), pp. 238-242.
Dual pushdown automata and context-sensitive grammars, Acta Cybernetica, Tom. 1, Fasc. 3, (1972), pp. 147-151.
Unilateral context-sensitive grammars and left-to-right parsing, Journal of Computer and System Sciences, Vol. 5, No. 4, (August 1971), pp. 337-352.
Parsing from left to right and structural properties of certain formal languages, Computational Linguistics and Computer Languages, Vol. VII. (1971), pp. 11-16.
Syntactic analysis and unilateral context-sensitive grammars, Studia Scientiarum Mathematicarum Hungarica, Vol. 4 (1969), pp. 267-278.
An efficient syntactic analyzer of certain formal languages, Mathematical Systems Theory, Vol. 2, No. 2, (June 1968), pp. 147-158.
Über ein Zuschnittproblem mit vielen Veränderlichen, Mathematik und Wirtschaft, Band. III (1966), pp. 425-465.
On the polynomial approximation of the exponential function (in Hungarian), Matematikai Lapok, Vol. XII, No. 3-4 (1961), pp. 221-231.
Categorical Combinators with explicit products, 7th International Conference on Automata and Formal Languages, Salgótarján, Hungary, 1993.
Parallel graph-reduction with a shared-memory multiprocessor system, Proc. IEEE 1990 International Conference on Computer Languages, New Orleans, (May 12-18), pp. 33-38.
Rule-based semantics for an extended lambda-calculus, Mathematical Foundations of Programming Language Semantics, (Ed. M. Main et al.), Lecture Notes in Computer Science Vol. 298, Springer Verlag 1988, pp. 43-56.
Algebraic properties of derivation words, Les arbres en algèbre et en programmation - 2. Coll. , Lille (1977), pp. 224-234.
Über Experimente der automatischen Programmierung auf der Maschine M-3 im Rechenzentrum der Ungarischen Akademie der Wissenschaften, Proc. Colloquium on the Foundations of Mathematics, Mathematical Machines and their Applications, Tihany (Sept. 1962), Akadémiai Kiadó, Budapest, 1965, pp. 239-244.