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
16
views
16
references
 Top references
cited by
1
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,007
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Mathematical Foundations of Computer Science 2014 

      Monadic Second-Order Logic with Arbitrary Monadic Predicates

      other
      Author(s): ,
      Publication date (Print):
      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 references16

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

          Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

          David Barrington (1989)
          Article 0 comments Cited 52 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Languages that Capture Complexity Classes

            Neil Immerman (1987)
            Article 0 comments Cited 46 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Book: not found

              Finite Automata, Formal Logic, and Circuit Complexity

              Howard Straubing (1994)
              Book 0 comments Cited 29 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2014
                Pages: 279-290
                DOI: 10.1007/978-3-662-44522-8_24
                SO-VID: 1e839a63-bbdb-418e-a418-cc0b8bb0cfe3
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,007

                See all similar

                Cited by1

                See all cited by