Monadic second-order definable graph transductions: a survey (Q1325847): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)90268-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993698725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of boundary and confluent graph grammars on graph languages of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of context-free sets of graphs generated by vertex replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / 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: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string generating power of context-free hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph languages of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of boundary graph grammars and context-free hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree transducers, L systems, and two-way machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank

Latest revision as of 14:51, 22 May 2024

scientific article
Language Label Description Also known as
English
Monadic second-order definable graph transductions: a survey
scientific article

    Statements

    Monadic second-order definable graph transductions: a survey (English)
    0 references
    0 references
    26 January 1995
    0 references
    monadic second-order logic
    0 references
    graph transductions
    0 references
    hyperedge replacement
    0 references
    vertex replacement
    0 references
    definable transductions
    0 references
    context-free languages
    0 references
    Parikh's theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers