Rewriting higher-order stack trees (Q2411043): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59603764 / rank
 
Normal rank
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/s00224-017-9769-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1502345479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite presentations of infinite structures: Automata and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Saturation Method for Collapsible Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming structures by set interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traces of term-automatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Higher-Order Stack Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of second-order theories and automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2842874 / rank
 
Normal rank

Latest revision as of 14:52, 14 July 2024

scientific article
Language Label Description Also known as
English
Rewriting higher-order stack trees
scientific article

    Statements

    Rewriting higher-order stack trees (English)
    0 references
    0 references
    20 October 2017
    0 references
    0 references
    automata theory
    0 references
    rewriting
    0 references
    infinite graphs
    0 references
    stack trees
    0 references
    0 references
    0 references