Solving the Weighted HOM-Problem With the Help of Unambiguity (Q6204136): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4386399953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The HOM Problem is EXPTIME-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical picture generation. A tree-based approach. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Supports of Weighted Unranked Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Tree Automata and Tree Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The HOM problem is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4700998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted tree automata with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A disambiguation algorithm for weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of a family of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disambiguation of weighted tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiler Design / rank
 
Normal rank

Latest revision as of 20:33, 29 August 2024

scientific article; zbMATH DE number 7828950
Language Label Description Also known as
English
Solving the Weighted HOM-Problem With the Help of Unambiguity
scientific article; zbMATH DE number 7828950

    Statements

    Solving the Weighted HOM-Problem With the Help of Unambiguity (English)
    0 references
    9 April 2024
    0 references

    Identifiers