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
26
views
22
references
Top references
cited by
1
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,718
similar
All similar
Record
: found
Abstract
: found
Book Chapter
: found
Is Open Access
Foundations of Software Science and Computation Structures
Two-Way Parikh Automata with a Visibly Pushdown Stack
other
Author(s):
Luc Dartois
,
Emmanuel Filiot
,
Jean-Marc Talbot
Publication date
(Online):
April 05 2019
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Download
XML
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
Open Research, Open Science, Open Scholarship
Most cited references
22
Record
: found
Abstract
: not found
Article
: not found
On Context-Free Languages
Rohit J. Parikh
(1966)
0
comments
Cited
89
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Reversal-Bounded Multicounter Machines and Their Decision Problems
Oscar H. Ibarra
(1978)
0
comments
Cited
54
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Adding nesting structure to words
Rajeev Alur
,
P. Madhusudan
(2009)
0
comments
Cited
45
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2019
Publication date (Online):
April 05 2019
Pages
: 189-206
DOI:
10.1007/978-3-030-17127-8_11
SO-VID:
fecb2cd8-55c0-49e3-87e3-29ba66a0c305
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games
pp. 27
Resource-Tracking Concurrent Games
pp. 45
Change Actions: Models of Generalised Differentiation
pp. 62
Coalgebra Learning via Duality
pp. 80
Tight Worst-Case Bounds for Polynomial Loop Programs
pp. 98
A Complete Normal-Form Bisimilarity for State
pp. 115
Identifiers in Registers
pp. 133
The Impatient May Use Limited Optimism to Minimize Regret
pp. 150
Causality in Linear Logic
pp. 169
Rewriting Abstract Structures: Materialization Explained Categorically
pp. 189
Two-Way Parikh Automata with a Visibly Pushdown Stack
pp. 207
Kleene Algebra with Hypotheses
pp. 224
Trees in Partial Higher Dimensional Automata
pp. 242
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains
pp. 260
Continuous Reachability for Unordered Data Petri Nets is in PTime
pp. 277
Optimal Satisfiability Checking for Arithmetic $$\mu $$ -Calculi
pp. 295
Constructing Inductive-Inductive Types in Cubical Type Theory
pp. 330
Higher-Order Distributions for Differential Linear Logic
pp. 348
Languages Ordered by the Subword Order
pp. 365
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces
pp. 382
A Sound and Complete Logic for Algebraic Effects
pp. 400
Equational Axiomatization of Algebras with Structure
pp. 418
Towards a Structural Proof Theory of Probabilistic $$\mu $$ -Calculi
pp. 436
Partial and Conditional Expectations in Markov Decision Processes with Integer Weights
pp. 453
Equational Theories and Monads from Polynomial Cayley Representations
pp. 470
A Dialectica-Like Interpretation of a Linear MSO on Infinite Words
pp. 488
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time
pp. 505
Justness
pp. 523
Path Category for Free
Similar content
1,718
On some decidability problems for HDOL systems with nonsingular Parikh matrices
Authors:
Keijo Ruohonen
On Core Words and the Parikh Matrix Mapping
Authors:
Wen Teh
Yet another proof of Parikh's Theorem
Authors:
Manfred Kufleitner
See all similar
Cited by
1
Two-way Parikh Automata
Authors:
Emmanuel Filiot
,
Shibashis Guha
,
Nicolas Mazzocchi
See all cited by