scientific article; zbMATH DE number 54244
From MaRDI portal
Publication:4004425
Cited in
(25)- On regular tree languages and deterministic pushdown automata
- On a representation of tree automata
- A fixpoint approach to finite delay and fairness
- Finite tree automata with cost functions
- Tree automata for code selection
- Tree adjoining languages and multipushdown languages
- Tree-shifts of finite type
- Hierarchies of tree series transformations
- Ordered context-free grammars
- Hyper-optimization for deterministic tree automata
- Computing the relative entropy between regular tree languages
- scientific article; zbMATH DE number 6683507 (Why is no real title available?)
- Learning Tree Languages
- From Tree-Based Generators to Delegation Networks
- Arbology: Trees and Pushdown Automata
- Rigid Tree Automata
- Binary Tree Code Words as Context-Free Languages
- scientific article; zbMATH DE number 475413 (Why is no real title available?)
- scientific article; zbMATH DE number 1051240 (Why is no real title available?)
- scientific article; zbMATH DE number 1136080 (Why is no real title available?)
- scientific article; zbMATH DE number 1494251 (Why is no real title available?)
- Symbolic tree automata
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Tree-based generation of languages of fractals
- The generative power of delegation networks
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 Q4004425)