Logical description of context-free graph languages
From MaRDI portal
Recommendations
- Regular description of context-free graph languages
- scientific article; zbMATH DE number 177436
- scientific article; zbMATH DE number 3909759
- Graph operators and its applications to context free languages
- scientific article; zbMATH DE number 2079028
- scientific article; zbMATH DE number 177789
- scientific article; zbMATH DE number 3976320
- Verification of graph grammars using a logical approach
- scientific article; zbMATH DE number 1923045
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3943061 (Why is no real title available?)
- scientific article; zbMATH DE number 4049099 (Why is no real title available?)
- scientific article; zbMATH DE number 4049102 (Why is no real title available?)
- scientific article; zbMATH DE number 4051027 (Why is no real title available?)
- scientific article; zbMATH DE number 17539 (Why is no real title available?)
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- scientific article; zbMATH DE number 1059243 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 965 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- scientific article; zbMATH DE number 1456950 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A comparison of boundary graph grammars and context-free hypergraph grammars
- A regular characterization of graph languages definable in monadic second-order logic
- Algebraic automata and context-free sets
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Boundary graph grammars with dynamic edge relabeling
- Combinatorial properties of boundary NLC graph languages
- Complement reducible graphs
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Decision Problems of Finite Automata Design and Related Arithmetics
- Easy problems for tree-decomposable graphs
- Efficient decision procedures for graph properties on context-free graph languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Graph expressions and graph rewritings
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Graph grammars and their application to computer science. 5th international workshop, Williamsburg, VA, USA, November 13--18, 1994. Selected papers
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handle-rewriting hypergraph grammars
- Hyperedge replacement: grammars and languages
- Linear graph grammars: Power and complexity
- Metatheorems for decision problems on hyperedge replacement graph languages
- Monadic second-order definable graph transductions: a survey
- Monadic second-order evaluations on tree-decomposable graphs
- Regular description of context-free graph languages
- Structural properties of context-free sets of graphs generated by vertex replacement
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- Tree acceptors and some of their applications
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(16)- Context-Sensitive Languages, Rational Graphs and Determinism
- Practical and efficient split decomposition via graph-labelled trees
- Weighted tree automata and weighted logics
- scientific article; zbMATH DE number 7559449 (Why is no real title available?)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- On the structure of linear apex NLC graph grammars
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Recognizability, hypergraph operations, and logical types
- Counting truth assignments of formulas of bounded tree-width or clique-width
- The Structure of Level-k Phylogenetic Networks
- scientific article; zbMATH DE number 4189193 (Why is no real title available?)
- On spectra of sentences of monadic second order logic with counting
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
This page was built for publication: Logical description of context-free graph languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384534)
