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
33
views
15
references
Top references
cited by
19
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,411
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
other
Author(s):
Arnaud Carayol
,
Stefan Wöhrle
Publication date
(Print):
2003
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
Higher order chromatin architecture
Most cited references
15
Record
: found
Abstract
: not found
Book Chapter
: not found
Higher-Order Pushdown Trees Are Easy
Teodor Knapik
,
Damian Niwinski
,
Paweł Urzyczyn
(2002)
0
comments
Cited
29
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Monadic second-order definable graph transductions: a survey
Bruno Courcelle
(1994)
0
comments
Cited
20
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
Arnaud Carayol
,
Stefan Wöhrle
(2003)
0
comments
Cited
19
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 112-123
DOI:
10.1007/978-3-540-24597-1_10
SO-VID:
7d988094-1abe-43a9-a808-ea9caaf7a93a
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 88
Pushdown Games with Unboundedness and Regular Conditions
pp. 112
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
pp. 124
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents
pp. 149
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Similar content
1,411
Automata-Based Dynamic Fault Tolerant Task Scheduling Approach in Fog Computing
Authors:
Sara Ghanavati
,
Jemal Abawajy
,
Davood Izadi
Optimization-based motion primitive automata for autonomous driving
Authors:
Matheus V. A. Pedrosa
,
Patrick Scheffe
,
Bassam Alrifaee
…
Modeling of urban change using remote sensing data and cellular automata technique
Authors:
K Abutaleb
,
F Ahmed
See all similar
Cited by
19
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
Authors:
Arnaud Carayol
,
Stefan Wöhrle
A Saturation Method for Collapsible Pushdown Systems
Authors:
Chris Broadbent
,
Arnaud Carayol
,
Matthew Hague
…
A Combinatorial Theorem for Trees
Authors:
Thomas Colcombet
See all cited by