Logical description of context-free graph languages (Q1384534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcss.1997.1510 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4212959352 / 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: Q3787507 / 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: Q4852905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars and their application to computer science. 5th international workshop, Williamsburg, VA, USA, November 13--18, 1994. Selected papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / 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: An axiomatic definition of context-free rewriting and its application to NLC graph grammars / 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: Q4385531 / 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: The monadic second-order logic of graphs. VII: Graphs as relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable graph transductions: a survey / 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: Q4353558 / 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: Context-free graph languages of bounded degree are generated by apex graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear graph grammars: Power and complexity / 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: Boundary graph grammars with dynamic edge relabeling / 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: A regular characterization of graph languages definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular description of context-free graph languages / 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: Q3323279 / 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: Metatheorems for decision problems on hyperedge replacement graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient decision procedures for graph properties on context-free graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / 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: Combinatorial properties of boundary NLC graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / 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: Q3785991 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCSS.1997.1510 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:14, 10 December 2024

scientific article
Language Label Description Also known as
English
Logical description of context-free graph languages
scientific article

    Statements

    Logical description of context-free graph languages (English)
    0 references
    0 references
    0 references
    4 August 1998
    0 references
    graph languages
    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
    0 references
    0 references

    Identifiers