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
32
views
0
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,853
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Automata, Languages and Programming
other
Editor(s):
Javier Leach Albert
,
Burkhard Monien
,
Mario Rodríguez Artalejo
Publication date
(Print):
1991
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-540-54233-9
ISBN (Electronic):
978-3-540-47516-3
Publication date (Print):
1991
DOI:
10.1007/3-540-54233-7
SO-VID:
8a76170f-6ae5-435f-88e3-505841fbce00
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 267
Canonical sets of horn clauses
pp. 115
Model-checking for probabilistic real-time systems
pp. 127
Computing behavioural relations, logically
pp. 217
CCS + time = an interleaving model for real time systems
pp. 327
Computing shortest paths and distances in planar graphs
pp. 441
On logics, tilings, and automata
pp. 532
Finding minimal forbidden minors using a finite congruence
pp. 588
An EILENBERG theorem for ∞-languages
Similar content
2,853
A Hierarchy of Polynomial-Time Computable Simulations for Automata
Authors:
Kousha Etessami
An efficient design of parallel and serial shift registers based on quantum-dot cellular automata
Authors:
S. FAN
,
M.S. Khamesinia
Operational efficiency of novel SISO shift register under thermal randomness in quantum-dot cellular automata design
Authors:
J.C. das
,
D De
See all similar
Cited by
1
Minor-closed graph classes with bounded layered pathwidth
Authors:
Vida Dujmović
,
David Eppstein
,
Gwenaël Joret
…
See all cited by