scientific article; zbMATH DE number 3576680

zbMath0369.68014MaRDI QIDQ4146243

Stephen J. Garland, David C. Luckham

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

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