Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
32
views
0
references
Top references
cited by
4
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,437
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Mathematical Foundations of Computer Science 2014
other
Editor(s):
Erzsébet Csuhaj-Varjú
,
Martin Dietzfelbinger
,
Zoltán Ésik
Publication date
(Print):
2014
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
Reviews of mathematical modeling in cancer
Author and book information
Book
ISBN (Print):
978-3-662-44521-1
ISBN (Electronic):
978-3-662-44522-8
Publication date (Print):
2014
DOI:
10.1007/978-3-662-44522-8
SO-VID:
56e0177a-978d-4164-884d-a526f6ad495b
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Partial-Observation Stochastic Reachability and Parity Games
pp. 5
Random Deterministic Automata
pp. 24
Communication Complexity Theory: Thirty-Five Years of Set Disjointness
pp. 44
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?
pp. 50
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
pp. 63
Sofic-Dyck Shifts
pp. 75
A Logical Characterization of Timed (non-)Regular Languages
pp. 87
Asymptotic Monadic Second-Order Logic
pp. 99
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules
pp. 111
Alternating Parity Krivine Automata
pp. 123
Advances in Parametric Real-Time Reasoning
pp. 135
Universal Lyndon Words
pp. 147
Subword Complexity and Decomposition of the Set of Factors
pp. 159
Cyclic Complexity of Words
pp. 171
Classifying Recognizable Infinitary Trace Languages Using Word Automata
pp. 183
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem
pp. 196
An Algebraic Characterization of Unary Two-Way Transducers
pp. 208
Size-Change Abstraction and Max-Plus Automata
pp. 220
Alternating Vector Addition Systems with States
pp. 232
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
pp. 244
Relating Nominal and Higher-Order Rewriting
pp. 256
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
pp. 267
Two Recursively Inseparable Problems for Probabilistic Automata
pp. 279
Monadic Second-Order Logic with Arbitrary Monadic Predicates
pp. 291
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
pp. 315
On Upper and Lower Bounds on the Length of Alternating Towers
pp. 327
L ax F: Side Conditions and External Evidence as Monads
pp. 340
The Monoid of Queue Actions
pp. 352
Undecidable Properties of Self-affine Sets and Multi-tape Automata
pp. 365
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality
pp. 377
A Unifying Approach for Multistack Pushdown Automata
pp. 390
Definability and Transformations for Cost Logics and Automatic Structures
pp. 402
Generalised Lyndon-Schützenberger Equations
pp. 414
Complexity of Equivalence and Learning for Multiplicity Tree Automata
pp. 426
Monadic Datalog and Regular Tree Pattern Queries
pp. 438
Model Checking Concurrent Recursive Programs Using Temporal Logics
pp. 451
Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals
pp. 464
Reachability in Pushdown Register Automata
pp. 474
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures
pp. 486
Determinising Parity Automata
pp. 499
Tight Bounds for Complementing Parity Automata
pp. 511
On Infinite Words Determined by Indexed Languages
pp. 523
A Pumping Lemma for Two-Way Finite Transducers
pp. 535
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems
pp. 547
The Dynamic Descriptive Complexity of k-Clique
Similar content
1,437
High Reliability Organization (HRO) systematic literature review: Discovery of culture as a foundational hallmark
Authors:
Jaime Cantu
,
Janice Tolk
,
Steve Fritts
…
2014 Code of Practice: how research evidence on the role and impact of teaching assistants can inform professional practice
Authors:
Rob Webster
Mathematical modeling of bone marrow – peripheral blood dynamics in the disease state based on current emerging paradigms, part II
Authors:
Evans K. Afenya
,
Rachid Ouifki
,
Suneel D Mundle
See all similar
Cited by
4
On the expressive power of invariants in parametric timed automata
Authors:
Étienne André
,
Didier Lime
,
Mathias Ramparison
Alternation Is Strict For Higher-Order Modal Fixpoint Logic
Authors:
Florian Bruse
What's decidable about parametric timed automata?
Authors:
Étienne André
See all cited by