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
30
views
14
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
4,341
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Developments in Language Theory
Connecting Decidability and Complexity for MSO Logic
other
Author(s):
Michał Skrzypczak
Publication date
(Online):
July 21 2017
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
ScienceOpen Research
Most cited references
14
Record
: found
Abstract
: not found
Book
: not found
Classical Descriptive Set Theory
Alexander S. Kechris
(1995)
0
comments
Cited
88
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Monadic Theory of Order
Saharon Shelah
(1975)
0
comments
Cited
42
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Subsystems of Second Order Arithmetic
Stephen Simpson
(2009)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
July 21 2017
Pages
: 75-79
DOI:
10.1007/978-3-319-62809-7_4
SO-VID:
d6be2d0b-eadd-4c4a-96b1-2bc5f1b7a1c2
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Computer Aided Synthesis: A Game-Theoretic Approach
pp. 36
A Comprehensive Introduction to the Theory of Word-Representable Graphs
pp. 68
Binomial Coefficients, Valuations, and Words
pp. 75
Connecting Decidability and Complexity for MSO Logic
pp. 83
On Regular Expression Proof Complexity
pp. 96
Operational State Complexity and Decidability of Jumping Finite Automata
pp. 109
Equivalence of Symbolic Tree Transducers
pp. 122
DFAs and PFAs with Long Shortest Synchronizing Word Length
pp. 134
On the Mother of All Automata: The Position Automaton
pp. 147
Two-Way Two-Tape Automata
pp. 160
Undecidability and Finite Automata
pp. 173
On the Power of Permitting Semi-conditional Grammars
pp. 185
On the Interplay Between Babai and Černý’s Conjectures
pp. 198
Differences Between 2D Neighborhoods According to Real Time Computation
pp. 210
A Medvedev Characterization of Recognizable Tree Series
pp. 222
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$
pp. 235
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
pp. 247
The Generalized Rank of Trace Languages
pp. 260
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results
pp. 272
Deleting Deterministic Restarting Automata with Two Windows
pp. 284
Relative Prefix Distance Between Languages
pp. 296
On the Tree of Binary Cube-Free Words
pp. 308
Limited Automata and Unary Languages
pp. 320
A Characterization of Infinite LSP Words
pp. 332
On Computational Complexity of Set Automata
pp. 345
On the Number of Rich Words
pp. 353
One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity
pp. 365
Classifying Non-periodic Sequences by Permutation Transducers
Similar content
4,341
MSO-Definable Regular Model Checking
Authors:
Vrunda Dave
,
Taylor Dohmen
,
Shankara Krishna
…
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability
Authors:
,
100 V class multiple stepped oxide field plate trench MOSFET (MSO-FP-MOSFET) aimed to ultimate structure realization
Authors:
K. KOBAYASHI
,
T Nishiguchi
,
S Katoh
…
See all similar