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
15
views
17
references
 Top references
cited by
1
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,137
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Graph Grammars and Their Application to Computer Science 

      Tree automata, tree decomposition and hyperedge replacement

      other
      Author(s):
      Publication date (Print):
      Publisher: Springer-Verlag

      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 references17

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

          Graph minors. II. Algorithmic aspects of tree-width

          Neil Robertson, P.D Seymour (1986)
          Article 0 comments Cited 217 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Complexity of Finding Embeddings in a k-Tree

            Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski (1987)
            Article 0 comments Cited 177 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Generalized finite automata theory with an application to a decision problem of second-order logic

              J. Thatcher, J B WRIGHT (1968)
              Article 0 comments Cited 70 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Pages: 520-537
                DOI: 10.1007/BFb0017410
                SO-VID: 75fe1095-1c42-4ccf-95da-1839981c6ae7
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,137

                See all similar

                Cited by1

                See all cited by