Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
23
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
2,963
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Mathematical Foundations of Computer Science 2014
Alternating Parity Krivine Automata
other
Author(s):
Florian Bruse
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
ScienceOpen Research
Most cited references
14
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
Visibly pushdown languages
Rajeev Alur
,
P. Madhusudan
(2004)
0
comments
Cited
64
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Pushdown Processes: Games and Model-Checking
Igor Walukiewicz
(2001)
0
comments
Cited
38
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 111-122
DOI:
10.1007/978-3-662-44522-8_10
SO-VID:
3b7f5848-1c53-4449-94c3-e1c88ca19470
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
2,963
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order
Authors:
Álvaro García-Pérez
,
Pablo Nogueira
,
Juan José Moreno-Navarro
From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine
Authors:
Wouter Swierstra
Shoenfield is Gödel after Krivine
Authors:
Thomas Streicher
,
Ulrich Kohlenbach
See all similar