scientific article; zbMATH DE number 3737028

MaRDI QIDQ3923599zbMATH OpenFDO

Authors A. Ja. Dikovskii

Publication date 1981

Full work available at URL https://eudml.org/doc/92136

zbMATH Keywords

complexity hierarchiescontext-free grammarsmimeoinvariant complexity measuresprogram schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• A helpful result for proving inherent ambiguity
• scientific article; zbMATH DE number 3757728 (Why is no real title available?)
• scientific article; zbMATH DE number 3480091 (Why is no real title available?)
• scientific article; zbMATH DE number 3557260 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3333284 (Why is no real title available?)
• Program schemes, recursion schemes, and formal languages
• The computational complexity of program schemata
• Theory of program structures: Schemes, semantics, verification

Cited in

(2)

• Biography of Alexandre Dikovsky
• The complexity of monadic recursion schemes: executability problems, nesting depth, and applications

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 Q3923599)