Solving the Weighted HOM-Problem With the Help of Unambiguity
From MaRDI portal
Publication:6204136
Recommendations
Cites work
- 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 1358710 (Why is no real title available?)
- A disambiguation algorithm for weighted automata
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Compiler design. Syntactic and semantic analysis
- Disambiguation of weighted tree automata
- 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
- On the definition of a family of automata
- The HOM Problem is EXPTIME-Complete
- The HOM problem is decidable
- The HOM problem is decidable
- The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
- The supports of weighted unranked tree automata
- Tree acceptors and some of their applications
- Weighted tree automata and tree transducers
- Weighted tree automata with constraints
This page was built for publication: Solving the Weighted HOM-Problem With the Help of Unambiguity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204136)