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
28
views
18
references
Top references
cited by
0
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,047
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Foundations of Software Science and Computation Structures
Quantifier Alternation for Infinite Words
other
Author(s):
Théo Pierron
,
Thomas Place
,
Marc Zeitoun
Publication date
(Print):
2016
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
ScienceOpen Research
Most cited references
18
Record
: found
Abstract
: not found
Article
: not found
On finite monoids having only trivial subgroups
M.P. Schützenberger
(1965)
0
comments
Cited
100
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Weak Second-Order Arithmetic and Finite Automata
J. Büchi
(1960)
0
comments
Cited
99
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Word problems requiring exponential time(Preliminary Report)
L. J. Stockmeyer
,
A. R. Meyer
(1973)
0
comments
Cited
85
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Pages
: 234-251
DOI:
10.1007/978-3-662-49630-5_14
SO-VID:
73a817c1-a05f-4eda-b7ca-00743448b82e
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
pp. 20
Guarded Dependent Type Theory with Coinductive Types
pp. 55
Game Semantics for Bounded Polymorphism
pp. 73
Join Inverse Categories as Models of Reversible Recursion
pp. 91
A Coalgebraic View of Bar Recursion and Bar Induction
pp. 107
A New Foundation for Finitary Corecursion
pp. 126
Fixed-Point Elimination in the Intuitionistic Propositional Calculus
pp. 145
A Theory of Monitors
pp. 162
Contextual Approximation and Higher-Order Procedures
pp. 180
A Theory of Slicing for Probabilistic Control Flow Graphs
pp. 197
Verification of Parameterized Communicating Automata via Split-Width
pp. 217
Robust Equilibria in Mean-Payoff Games
pp. 234
Quantifier Alternation for Infinite Words
pp. 252
Synchronizing Automata over Nested Words
pp. 269
On Freeze LTL with Ordered Attributes
pp. 285
Regular Transformations of Data Words Through Origin Information
pp. 303
Trace Refinement in Labelled Markov Decision Processes
pp. 319
Qualitative Analysis of VASS-Induced MDPs
pp. 335
Metric Temporal Logic with Counting
pp. 353
Distributed Synthesis in Continuous Time
pp. 373
Unary Resolution: Characterizing Ptime
pp. 390
Focused and Synthetic Nested Sequents
pp. 408
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms
pp. 424
Reasoning About Call-by-need by Means of Types
pp. 479
The Invariance Problem for Matrix Semigroups
pp. 493
Order-Sorted Rewriting and Congruence Closure
pp. 513
Towards a Formal Theory of Graded Monads
pp. 531
Profinite Monads, Profinite Equations, and Reiterman’s Theorem
Similar content
3,047
Explicit constructions of infinite families of MSTD sets
Authors:
Brooke Orosz
,
Steven J. Miller
,
Daniel Scheinerman
Owings-like results for infinitely many colours or finite monochromatic sets
Authors:
David J. Fernández-Bretón
,
Eliseo Sarmiento Rosales
,
Germán Vera
First Order Decidability and Definability of Integers in Infinite Algebraic Extensions of Rational Numbers
Authors:
Alexandra Shlapentokh
See all similar