Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Courcelle:1993:MSO, author = "B. Courcelle and M. Mosbah", title = "Monadic second-order evaluations on tree-decomposable graphs", journal = j-THEOR-COMP-SCI, volume = "109", number = "1--2", pages = "49--82", day = "01", month = mar, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:00 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=109&issue=1-2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=109&issue=1-2&aid=1257", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Bordeaux, France; 21-23 March 1991", conftitle = "International Workshop on Computing by Graph Transformation", corpsource = "Lab. d'Inf., Bordeaux-I Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; derivation tree; formal logic; grammars; graph theory; hyperedge replacement graph-grammar; linear algorithms; monadic second-order logic; polynomial algorithms; semiring homomorphisms; tree-decomposable graphs; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }