The following pages link to (Q4160409):
Displayed 10 items.
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- Data structures for distributed counting (Q794431) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- Finite tree automata with cost functions (Q1325851) (← links)
- The speed of copying on one-tape off-line turing machines (Q1824387) (← links)
- Deterministic Turing machines in the range between real-time and linear-time. (Q1853527) (← links)
- A Hierarchy of Fast Reversible Turing Machines (Q2822488) (← links)
- Deciding equivalence of finite tree automata (Q5096180) (← links)