Weighted tree automata with constraints (Q2164002): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285164036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality and disequality constraints on direct subterms in tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3431477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942651 / 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: Q4449537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2882382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Tree Automata and Tree Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395720 / 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: 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: 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: Tree Automata, (Dis-)Equality Constraints and Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4383325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiler Design / rank
 
Normal rank

Latest revision as of 20:58, 29 July 2024

scientific article
Language Label Description Also known as
English
Weighted tree automata with constraints
scientific article

    Statements

    Weighted tree automata with constraints (English)
    0 references
    0 references
    0 references
    11 August 2022
    0 references

    Identifiers