Hypergraph Rewriting Using Conformisms
- 作者M. Monserrat; F. Rosselló; J. Torrens; G. Valiente
- 卷第2卷
- 印刷ISSN1571-0661
- 文件大小362.74KB
- 发表时间1995
- DOI10.1016/s1571-0661(05)80198-7
- 页码207-214
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order LogicIain A. Stewart · 1997
The monadic second-order logic of graphs XII: planar graphs and planar mapsBruno Courcelle · 2000
Conceptual Graphs and First Order LogicAmati, G. · The Computer Journal · 2000
Product of Graphs and Hybrid LogicMario R.F. Benevides; L. Menasché Schechter · 2009
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantificationsBruno Courcelle · 2003
[Studies in Logic and the Foundations of Mathematics] Logic Colloquium '77 Volume 96 || -Categoricity and Comparability GraphsSchmerl, James H. · 1978
Circle graphs and monadic second-order logicBruno Courcelle · 2008
On some classes of interpretationsBruno Courcelle; Irène Guessarian · 1978
Handle-rewriting hypergraph grammarsBruno Courcelle; Joost Engelfriet; Grzegorz Rozenberg · 1993
Fundamental properties of infinite treesBruno Courcelle · 1983
Fundamental properties of infinite treesBruno Courcelle · 1983
Graph expressions and graph rewritingsMichel Bauderon; Bruno Courcelle · Theory of Computing Systems · 1987
On jump-deterministic pushdown automataBruno Courcelle · Theory of Computing Systems · 1977-1978
Some negative results concerning DPDA'sBruno Courcelle · 1984