Weighted HOM-problem for nonnegative integers
From MaRDI portal
Cites work
- Automated Induction with Constrained Tree Automata
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Compiler design. Syntactic and semantic analysis
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Grammatical picture generation. A tree-based approach. With CD-ROM.
- Graph automata
- scientific article; zbMATH DE number 5141496 (Why is no real title available?)
- scientific article; zbMATH DE number 3924161 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 1257742 (Why is no real title available?)
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- scientific article; zbMATH DE number 794243 (Why is no real title available?)
- On a problem of formal logic.
- On the definition of a family of automata
- Solving the Weighted HOM-Problem With the Help of Unambiguity
- The HOM problem is decidable
- The HOM problem is decidable
- The HOM problem is EXPTIME-complete
- Tree acceptors and some of their applications
- Weighted extended tree transducers
- Weighted tree automata and tree transducers
This page was built for publication: Weighted HOM-problem for nonnegative integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902669)
