Deterministic top-down tree automata with Boolean deterministic look-ahead
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3888931 (Why is no real title available?)
- scientific article; zbMATH DE number 3711381 (Why is no real title available?)
- scientific article; zbMATH DE number 17541 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 480524 (Why is no real title available?)
- scientific article; zbMATH DE number 3304085 (Why is no real title available?)
- A representation of trees by languages. II
- Aural pattern recognition experiments and the subregular hierarchy
- Cognitive and sub-regular complexity
- Deterministic top-down tree automata: past, present, and future
- Minimization of deterministic top-down tree automata
- On languages piecewise testable in the strict sense
- Top-down tree transducers with deterministic top-down look-ahead
- Top-down tree transducers with regular look-ahead
Cited in
(2)
This page was built for publication: Deterministic top-down tree automata with Boolean deterministic look-ahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163373)