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
32
views
10
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,739
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Science – Theory and Applications
Level Two of the Quantifier Alternation Hierarchy over Infinite Words
other
Author(s):
Manfred Kufleitner
,
Tobias Walter
Publication date
(Online):
May 31 2016
Publisher:
Springer International Publishing
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
Critical Literacy
Most cited references
10
Record
: found
Abstract
: not found
Article
: not found
On a Problem of Formal Logic
F. Ramsey
(1930)
0
comments
Cited
256
times
– based on
0
reviews
Review now
Bookmark
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
The dot-depth hierarchy of star-free languages is infinite
R. Knast
,
J.A. Brzozowski
(1978)
0
comments
Cited
33
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
May 31 2016
Pages
: 223-236
DOI:
10.1007/978-3-319-34171-2_16
SO-VID:
ff010744-2221-4764-8583-e47afa84da7b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
On High-Quality Synthesis
pp. 16
Sensitivity Versus Certificate Complexity of Boolean Functions
pp. 29
Algorithmic Decidability of Engel’s Property for Automaton Groups
pp. 41
The Next Whisky Bar
pp. 57
Parameterizing Edge Modification Problems Above Lower Bounds
pp. 73
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing
pp. 88
Max-Closed Semilinear Constraint Satisfaction
pp. 102
Computing and Listing st-Paths in Public Transportation Networks
pp. 117
Compositional Design of Stochastic Timed Automata
pp. 131
Online Bounded Analysis
pp. 146
Affine Computation and Affine Automaton
pp. 161
On Approximating (Connected) 2-Edge Dominating Set by a Tree
pp. 177
Graph Editing to a Given Degree Sequence
pp. 192
Subclasses of Baxter Permutations Based on Pattern Avoidance
pp. 207
On Slepian–Wolf Theorem with Interaction
pp. 223
Level Two of the Quantifier Alternation Hierarchy over Infinite Words
pp. 237
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
pp. 251
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
pp. 266
Sums of Read-Once Formulas: How Many Summands Suffice?
pp. 280
Algorithmic Statistics: Normal Objects and Universal Models
pp. 294
Subquadratic Algorithms for Succinct Stable Matching
pp. 309
Depth-4 Identity Testing and Noether’s Normalization Lemma
pp. 324
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
pp. 340
The Hardest Language for Conjunctive Grammars
pp. 352
Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
pp. 367
Representations of Analytic Functions and Weihrauch Degrees
pp. 382
On Expressive Power of Regular Expressions over Infinite Orders
pp. 394
Prediction of Infinite Words with Automata
pp. 409
Fourier Sparsity of GF(2) Polynomials
Similar content
2,739
Characters of infinite-dimensional quantum classical groups: BCD cases
Authors:
Ryosuke Sato
Explicit constructions of infinite families of MSTD sets
Authors:
Brooke Orosz
,
Steven J. Miller
,
Daniel Scheinerman
Social Optima in Robust Mean Field LQG Control: From Finite to Infinite Horizon
Authors:
Bing-Chang Wang
,
Jianhui Huang
,
Ji-Feng Zhang
See all similar
Cited by
1
Quantifier Alternation for Infinite Words
Authors:
Théo Pierron
,
Thomas Place
,
Marc Zeitoun
See all cited by