scientific article; zbMATH DE number 3594649

MaRDI QIDQ4160409zbMATH OpenFDO

Authors Wolfgang J. Paul

Publication date 1978

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)

Cited in

(10)

• Deterministic Turing machines in the range between real-time and linear-time.
• Parameter-reduction of higher level grammars
• Deciding equivalence of finite tree automata
• On the degree of ambiguity of finite automata
• Single-valuedness of tree transducers is decidable in polynomial time
• The speed of copying on one-tape off-line turing machines
• Finite tree automata with cost functions
• Data structures for distributed counting
• A hierarchy of fast reversible Turing machines
• The complexity types of computable sets

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