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
33
views
13
references
Top references
cited by
5
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,039
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
A Fragment of ML Decidable by Visibly Pushdown Automata
other
Author(s):
David Hopkins
,
Andrzej S. Murawski
,
C. -H. Luke Ong
Publication date
(Print):
2011
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
Annual Reviews AI, Machine Learning, and Society
Most cited references
13
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
Book Chapter
: not found
Call-by-value games
Samson Abramsky
,
Guy McCusker
(1998)
0
comments
Cited
20
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Deciding Equivalence of Finite Tree Automata
Helmut Seidl
(1990)
0
comments
Cited
17
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 149-161
DOI:
10.1007/978-3-642-22012-8_11
SO-VID:
17d7b242-f5f8-4964-bc79-ebca9f1e05da
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Nondeterministic Streaming String Transducers
pp. 21
An Introduction to Randomness Extractors
pp. 42
Invitation to Algorithmic Uses of Inclusion–Exclusion
pp. 60
On the Relation between Differential Privacy and Quantitative Information Flow
pp. 89
Rice’s Theorem for μ-Limit Sets of Cellular Automata
pp. 101
Fault-Tolerant Compact Routing Schemes for General Graphs
pp. 113
Local Matching Dynamics in Social Networks
pp. 125
Regular Languages of Words over Countable Linear Orderings
pp. 137
Algebraic Independence and Blackbox Identity Testing
pp. 149
A Fragment of ML Decidable by Visibly Pushdown Automata
pp. 162
Krivine Machines and Higher-Order Schemes
pp. 174
Relating Computational Effects by ⊤ ⊤-Lifting
pp. 186
Constructing Differential Categories and Deconstructing Categories of Games
pp. 198
Nondeterminism Is Essential in Small 2FAs with Few Reversals
pp. 210
Isomorphism of Regular Trees and Words
pp. 222
On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids
pp. 234
The Cost of Traveling between Languages
pp. 246
Emptiness and Universality Problems in Timed Automata with Positive Frequency
pp. 258
Büchi Automata Can Have Smaller Quotients
pp. 271
Automata-Based CSL Model Checking
pp. 283
A Progress Measure for Explicit-State Probabilistic Model-Checkers
pp. 295
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
pp. 307
On the Semantics of Markov Automata
pp. 319
Runtime Analysis of Probabilistic Programs with Unbounded Recursion
pp. 332
Approximating the Termination Value of One-Counter MDPs and Stochastic Games
pp. 344
Generic Expression Hardness Results for Primitive Positive Formula Comparison
pp. 356
Guarded Negation
pp. 368
Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates
pp. 380
Modular Markovian Logic
pp. 404
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
pp. 416
On Reachability for Hybrid Automata over Bounded Time
pp. 428
Deciding Robustness against Total Store Ordering
pp. 441
Multiply-Recursive Upper Bounds with Higman’s Lemma
pp. 453
Liveness-Preserving Atomicity Abstraction
pp. 466
On Stabilization in Herman’s Algorithm
pp. 478
Online Graph Exploration: New Results on Old and New Algorithms
pp. 490
Distance Oracles for Vertex-Labeled Graphs
pp. 502
Asymptotically Optimal Randomized Rumor Spreading
pp. 514
Fast Convergence for Consensus in Dynamic Networks
pp. 526
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
pp. 539
Restoring Pure Equilibria to Weighted Congestion Games
pp. 552
Existence and Uniqueness of Equilibria for Flows over Time
pp. 564
Collusion in Atomic Splittable Routing Games
pp. 588
Adaptively Secure Non-interactive Threshold Cryptosystems
pp. 613
Efficient Distributed Communication in Ad-Hoc Radio Networks
pp. 625
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model
pp. 637
Convergence Time of Power-Control Dynamics
pp. 650
A New Approach for Analyzing Convergence Algorithms for Mobile Robots
Similar content
2,039
Reduced nephrotoxicity with vancomycin therapeutic drug monitoring guided by area under the concentration–time curve against a trough 15–20 μg/mL concentration
Authors:
Kazutaka Oda
,
Hirofumi Jono
,
Kisato Nosaka
…
What can data-centric AI learn from data and ML engineering?
Authors:
Malt: distributed data-parallelism for existing ml applications
Authors:
See all similar
Cited by
5
Algorithmic Games for Full Ground References
Authors:
Andrzej Murawski
,
Nikos Tzevelekos
Contextual Approximation and Higher-Order Procedures
Authors:
Ranko Lazic
,
Andrzej Murawski
Hector: An Equivalence Checker for a Higher-Order Fragment of ML
Authors:
David Hopkins
,
Andrzej Murawski
,
C. -H. Luke Ong
See all cited by