scientific article; zbMATH DE number 3976378
From MaRDI portal
Publication:3741087
Recommendations
Cited in
(16)- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
- scientific article; zbMATH DE number 5000964 (Why is no real title available?)
- Automated Induction with Constrained Tree Automata
- Arbology: Trees and Pushdown Automata
- scientific article; zbMATH DE number 5529981 (Why is no real title available?)
- scientific article; zbMATH DE number 4035104 (Why is no real title available?)
- Prolog infinite trees and automata
- scientific article; zbMATH DE number 475422 (Why is no real title available?)
- scientific article; zbMATH DE number 1051240 (Why is no real title available?)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Symbolic tree automata
- Manipulating tree tuple languages by transforming logic programs
- An Automata Theoretic Approach to Rational Tree Relations
- Logic and Branching Automata
- Tree tuple languages from the logic programming point of view
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 Q3741087)