Simple program schemes and formal languages

MaRDI QIDQ1846738zbMATH OpenFDO

Authors Joost Engelfriet

Publication date 1974

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(14)

• Probabilistic Ianov's schemes
• Free iterative and iteration K-semialgebras
• On a class of recursive procedures and equivalent iterative ones
• A direct algorithm for checking equivalence of LL(k) grammars
• IO and OI. II
• IO and OI. I
• Context-free series on trees
• Expressive power of typed and type-free programming languages
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• Equational theories for automata
• Extended linear macro grammars, iteration grammars, and register programs
• 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

This page was built for publication: Simple program schemes and formal languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1846738)