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
90
views
0
references
Top references
cited by
119
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,703
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theoretical Computer Science
Concurrency and automata on infinite sequences
other
Author(s):
David Park
Publication date
(Print):
1981
Publisher:
Springer-Verlag
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
Author and book information
Book Chapter
Pages
: 167-183
DOI:
10.1007/BFb0017309
SO-VID:
57a207b8-d3e7-4e31-87e5-2f141595481d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 146
Some applications of CFL's over infinite alphabets
pp. 167
Concurrency and automata on infinite sequences
Similar content
2,703
Automata-Based Dynamic Fault Tolerant Task Scheduling Approach in Fog Computing
Authors:
Sara Ghanavati
,
Jemal Abawajy
,
Davood Izadi
Optimization-based motion primitive automata for autonomous driving
Authors:
Matheus V. A. Pedrosa
,
Patrick Scheffe
,
Bassam Alrifaee
…
Modeling of urban change using remote sensing data and cellular automata technique
Authors:
K Abutaleb
,
F Ahmed
See all similar
Cited by
115
Cyber–Physical Systems: A Perspective at the Centennial
Authors:
Kyoung-Dae Kim
,
P. Kumar
Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
Authors:
G Pola
,
A. Girard
,
P. Tabuada
Controlling a Class of Nonlinear Systems on Rectangles
Authors:
Calin Belta
,
Luc Habets
See all cited by