Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
81
views
14
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,095
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Mathematical Foundations of Computer Science 2013
Reachability in Register Machines with Polynomial Updates
other
Author(s):
Alain Finkel
,
Stefan Göller
,
Christoph Haase
Publication date
(Print):
2013
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
ScienceOpen Research
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
Sign in to comment
Book chapters
pp. 146
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
pp. 290
Paradigms for Parameterized Enumeration
pp. 74
Computing Behavioral Distances, Compositionally
pp. 266
On Stochastic Games with Multiple Objectives
pp. 314
Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
pp. 409
Reachability in Register Machines with Polynomial Updates
pp. 551
Improved Complexity Results on k-Coloring P t -Free Graphs
pp. 729
Separating Regular Languages by Piecewise Testable and Unambiguous Languages
pp. 777
Feasible Combinatorial Matrix Theory
Similar content
3,095
The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems
Authors:
Michel Hack
Context-sensitive data-dependence analysis via linear conjunctive language reachability
Authors:
Qirun Zhang
,
Zhendong Su
Upper extremity 3-dimensional reachable workspace analysis in dystrophinopathy using Kinect.
Authors:
Jay Han
,
Gregorij Kurillo
,
Richard Abresch
…
See all similar
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