Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
18
views
10
references
 Top references
cited by
0
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,041
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Fundamentals of Computation Theory 

      Context-free graph grammars: Separating vertex replacement from hyperedge replacement

      other
      Author(s):
      Publication date (Online):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references10

          • Record: found
          • Abstract: not found
          • Article: not found

          The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

          Bruno Courcelle (1990)
          Article 0 comments Cited 224 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            Graph Rewriting: An Algebraic and Logic Approach

            Bruno Courcelle (1990)
            Article 0 comments Cited 54 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Tree acceptors and some of their applications

              John Doner (1970)
              Article 0 comments Cited 38 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 1993
                Publication date (Online): May 30 2005
                Pages: 181-193
                DOI: 10.1007/3-540-57163-9_14
                SO-VID: 1ba2f872-c0df-4c4a-8c6a-28897d85c23b
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,041

                See all similar