scientific article; zbMATH DE number 3594649
From MaRDI portal
zbMath0382.68044MaRDI QIDQ4160409
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Finite tree automata with cost functions, Parameter-reduction of higher level grammars, Deciding equivalence of finite tree automata, On the degree of ambiguity of finite automata, The complexity types of computable sets, Single-valuedness of tree transducers is decidable in polynomial time, A Hierarchy of Fast Reversible Turing Machines, The speed of copying on one-tape off-line turing machines, Data structures for distributed counting, Deterministic Turing machines in the range between real-time and linear-time.
