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 24

Record: found
Abstract: not found
Article: not found

An Algorithm for the General Petri Net Reachability Problem

Ernst W Mayr (1984)

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

Bookmark

Record: found
Abstract: not found
Article: not found

Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors

Leonard Eugene Dickson (1913)

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

Bookmark

Record: found
Abstract: not found
Article: not found

Semigroups, Presburger formulas, and languages

Edwin Spanier, Seymour Ginsburg (1966)

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

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2005

Pages: 489-503

DOI: 10.1007/11562948_36

SO-VID: 58b43844-bb8a-4f32-8f71-03547c962072

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 17

Verification of population protocols
Authors: Javier Esparza, Pierre Ganty, Jérôme Leroux …
FAST: acceleration from theory to practice
Authors: Alain Finkel, Sébastien Bardin, Laure Petrucci …
FAST Extended Release
Authors: Sébastien Bardin, Jérôme Leroux, Gérald Point

See all cited by

Flat Counter Automata Almost Everywhere!

Read this book at

Related collections

ScienceOpen Research

Most cited references 24

An Algorithm for the General Petri Net Reachability Problem

Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors

Semigroups, Presburger formulas, and languages

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 1,901

Cited by 17