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
Sign in
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
Sign in
Register
Dashboard
Search
31
views
0
references
Top references
cited by
11
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,308
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Automata, Languages, and Programming
other
Editor(s):
Magnús M. Halldórsson
,
Kazuo Iwama
,
Naoki Kobayashi
,
Bettina Speckmann
Publication date
(Print):
2015
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
Smart Contracts Programming Languages
Author and book information
Book
ISBN (Print):
978-3-662-47665-9
ISBN (Electronic):
978-3-662-47666-6
Publication date (Print):
2015
DOI:
10.1007/978-3-662-47666-6
SO-VID:
b58e1a10-152a-4e19-86ba-48bd87d9443a
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 663
Adaptively Secure Coin-Flipping, Revisited
pp. 69
Language Emptiness of Continuous-Time Parametric Timed Automata
pp. 159
Reachability is in DynFO
pp. 234
The Odds of Staying on Budget
pp. 311
Owicki-Gries Reasoning for Weak Memory Models
pp. 375
Liveness of Parameterized Timed Networks
pp. 401
Effect Algebras, Presheaves, Non-locality and Contextuality
pp. 479
Polylogarithmic-Time Leader Election in Population Protocols
pp. 528
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
Similar content
3,308
Theory of Finite Automata with an Introduction to Formal Languages
Authors:
J. CARROLL
Modelling urban growth evolution and land-use changes using GIS based cellular automata and SLEUTH models: the case of Sana’a metropolitan city, Yemen
Authors:
Biswajeet Pradhan
,
Abubakr A. A. Al-Sharif
,
Shattri Mansor
…
Urban sprawl modeling using cellular automata
Authors:
Shikhar Deep
,
Akansha Saklani
See all similar
Cited by
11
Duality Theory for Optimal Multidimensional Auctions
Authors:
,
Proving linearizability using forward simulations
Authors:
Ahmed Bouajjani
,
Michael Emmi
,
Constantin Enea
…
On the expressive power of invariants in parametric timed automata
Authors:
Étienne André
,
Didier Lime
,
Mathias Ramparison
See all cited by