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