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
20
views
40
references
 Top references
cited by
2
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,513
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Descriptional Complexity of Formal Systems 

      Automata with Reversal-Bounded Counters: A Survey

      other
      Author(s):
      Publication date (Print):
      Publisher: Springer International Publishing

      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 references40

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          Visibly pushdown languages

          Rajeev Alur, P. Madhusudan (2004)
          Article 0 comments Cited 64 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines

            Marvin Minsky (1961)
            Article 0 comments Cited 64 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Reversal-Bounded Multicounter Machines and Their Decision Problems

              Oscar H. Ibarra (1978)
              Article 0 comments Cited 54 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2014
                Pages: 5-22
                DOI: 10.1007/978-3-319-09704-6_2
                SO-VID: 62a2231f-0864-4856-8348-114c7f524e18
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,513

                See all similar

                Cited by2

                See all cited by