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
10
views
15
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,097
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
STACS 93
Recursive automata on infinite words
other
Author(s):
Ludwig Staiger
Publication date
(Online):
May 27 2005
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
Recursive Rule based Visual Categorization
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
Decision problems forω-automata
L. H. Landweber
(1969)
0
comments
Cited
59
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On ω-regular sets
Klaus W. Wagner
(1979)
0
comments
Cited
36
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Propositional dynamic logic of looping and converse is elementarily decidable
Robert S. Streett
(1982)
0
comments
Cited
33
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1993
Publication date (Online):
May 27 2005
Pages
: 629-639
DOI:
10.1007/3-540-56503-5_62
SO-VID:
9fc1bd36-a2c7-4904-bf9b-63cdb857d292
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 58
Decidability and undecidability results for duration calculus
pp. 216
Counting overlap-free binary words
pp. 607
Locally threshold testable languages of infinite words
pp. 629
Recursive automata on infinite words
Similar content
1,097
Low-power, high-speed, and area-efficient sequential circuits by quantum-dot cellular automata: T-latch and counter study
Authors:
Mohammad Gholami
,
Zaman Amirzadeh
The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
Authors:
Fred Lunnon
Parallel and fully recursive multifrontal sparse Cholesky
Authors:
Dror Irony
,
Gil Shklarski
,
Sivan Toledo
See all similar
Cited by
3
Logical specifications of infinite computations
Authors:
Wolfgang Thomas
,
Helmut Lescow
Wadge Degrees of \(\omega\)-Languages of Petri Nets
Authors:
Olivier Finkel
Ambiguity of {\omega}-Languages of Turing Machines
Authors:
Olivier Finkel
See all cited by