ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
7
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
3,942
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
3,942
Boolean TQFTs with accumulating defects, sofic systems, and automata for infinite words
Authors:
Paul Gustafson
,
Mee Seong Im
,
Mikhail Khovanov
Recursive interlocking puzzles
Authors:
Peng Song
,
Chi-Wing Fu
,
Daniel Cohen-OR
…
Formulation of a fast 2D urban pluvial flood model using a cellular automata approach
Authors:
Bidur Ghimire
,
Edward C Keedwell
,
Slobodan Djordjević
…
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