Two Families of Languages Related to ALGOL

DOI10.1145/321127.321132zbMath0161.13903OpenAlexW2000118875WikidataQ29037918 ScholiaQ29037918MaRDI QIDQ5543072

Seymour Ginsburg, G. H. Rice

Publication date: 1962

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321127.321132

zbMATH Keywords

numerical analysis

Related Items (15)

Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. ⋮ Unnamed Item ⋮ Rational elements of summation semirings ⋮ Descriptional complexity of bounded context-free languages ⋮ Binary coded unary regular languages ⋮ Minimal Size of Counters for (Real-Time) Multicounter Automata ⋮ Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ Non-Self-Embedding Grammars and Descriptional Complexity ⋮ Pushdown automata and constant height: decidability and bounds ⋮ Deterministic Pushdown Automata and Unary Languages ⋮ Limited automata and unary languages ⋮ Bi-inductive structural semantics ⋮ Substitution expressions ⋮ Language equations ⋮ Context-free series on trees

This page was built for publication: Two Families of Languages Related to ALGOL