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
98
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
4,545
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
4,545
A novel algorithm for calculating transition potential in cellular automata models of land-use/cover change
Authors:
Majid Roodposhti
,
Jagannath Aryal
,
Brett Bryan
Fuzzy Automata and Decision Process
Authors:
M Sugeno
,
M. Sugeno
Image segmentation and classification of MRI brain tumor based on cellular automata and neural networks
Authors:
R. Rajkumar
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