scientific article

zbMath0469.68050MaRDI QIDQ3923599

A. Ja. Dikovskii

Publication date: 1981

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

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

zbMATH Keywords

context-free grammarsprogram schemescomplexity hierarchiesmimeoinvariant complexity measures

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)

Related Items (2)

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

Cites Work

• The computational complexity of program schemata
• Theory of program structures: Schemes, semantics, verification
• Program schemes, recursion schemes, and formal languages
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: