Simple program schemes and formal languages
From MaRDI portal
Publication:1846738
zbMath0288.68030MaRDI QIDQ1846738
Publication date: 1974
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items (14)
Probabilistic Ianov's schemes ⋮ Free iterative and iteration \(K\)-semialgebras ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ An execution mechanism for nondeterministic, state-oriented programs based on a chart parser ⋮ Nondeterministic program schemata and their relation to dynamic logic ⋮ A direct algorithm for checking equivalence of LL(k) grammars ⋮ IO and OI. I ⋮ IO and OI. II ⋮ Extended linear macro grammars, iteration grammars, and register programs ⋮ On a class of recursive procedures and equivalent iterative ones ⋮ Expressive power of typed and type-free programming languages ⋮ Equational theories for automata ⋮ Context-free series on trees
This page was built for publication: Simple program schemes and formal languages
