scientific article; zbMATH DE number 3576680

MaRDI QIDQ4146243zbMATH OpenFDO

Authors Stephen J. Garland, David C. Luckham

Publication date 1976

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited in

(20)

• Effective proper procedures and universal classes of program schemata
• Counter machines
• A direct algorithm for checking equivalence of LL(k) grammars
• \(L(A)=L(B)\)? decidability results from complete formal systems
• IO and OI. II
• Functional systems: Theoretical and practical aspects
• IO and OI. I
• The IO- and OI-hierarchies
• Transformations of sequential specifications into concurrent specifications by synchronization guards
• Functionality problem in a class of relation schemas
• Quasirelations in a free group and transformator equivalence problems
• Regular algebra of functionals of labeled trees
• The complexity of monadic recursion schemes: Exponential time bounds
• Recursion-closed algebraic theories
• An algorithm deciding functional equivalence in a new class of program schemes
• Program schemata with polynomial bounded counters
• The computational complexity of program schemata
• The tree equivalence of linear recursion schemes
• Program equivalence and context-free grammars
• Equivalence problems for deterministic context-free languages and monadic recursion schemes

This page was built for publication:

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