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 references 14

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)

0 comments Cited 64 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

Reset nets between decidability and undecidability

C. Dufourd, A Finkel, Ph. Schnoebelen (1998)

0 comments Cited 41 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

A structure to decide reachability in Petri nets

J.L. Lambert (1992)

0 comments Cited 24 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2013

Pages: 409-420

DOI: 10.1007/978-3-642-40313-2_37

SO-VID: 0698031b-ec01-4dc9-aae3-2d95c645414a

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 8

Integer Vector Addition Systems with States
Authors: Christoph Haase, Simon Halfon
Integer Vector Addition Systems with States
Authors: ,
Reachability Problem for Polynomial Iteration Is PSPACE-complete
Authors: Reino Niskanen

See all cited by

Reachability in Register Machines with Polynomial Updates

Read this book at

Related collections

ScienceOpen Research

Most cited references 14

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

Reset nets between decidability and undecidability

A structure to decide reachability in Petri nets

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 3,201

Cited by 8