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
20
views
17
references
Top references
cited by
8
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,776
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
A Combinatorial Theorem for Trees
other
Author(s):
Thomas Colcombet
Publication date
(Print):
2007
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
17
Record
: found
Abstract
: not found
Book Chapter
: not found
Languages, Automata, and Logic
Wolfgang Thomas
(1997)
0
comments
Cited
147
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Decidability of Second-Order Theories and Automata on Infinite Trees
Michael O. Rabin
(1969)
0
comments
Cited
65
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Monadic Theory of Order
Saharon Shelah
(1975)
0
comments
Cited
42
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Pages
: 901-912
DOI:
10.1007/978-3-540-73420-8_77
SO-VID:
c7e5f8b5-5f99-47db-b0cd-e492c3ca5b4c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 316
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
pp. 40
Mechanism Design for Fractional Scheduling on Unrelated Machines
pp. 375
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
pp. 423
Ring Signatures of Sub-linear Size Without Random Oracles
pp. 472
Co-Logic Programming: Extending Logic Programming with Coinduction
pp. 509
Succinct Ordinal Trees Based on Tree Covering
pp. 901
A Combinatorial Theorem for Trees
Similar content
1,776
Proving Taylor's Theorem from the Fundamental Theorem of Calculus by Fixed-point Iteration
Authors:
Christopher Thron
Network Theory Analysis of Antibody-Antigen Reactivity Data: The Immune Trees at Birth and Adulthood
Authors:
Asaf Madi
,
Dror Kenett
,
Sharron Bransburg-Zabary
…
Biomedical Image Classification with Random Subwindows and Decision Trees
Authors:
Raphaël Marée
,
Pierre Geurts
,
Justus Piater
…
See all similar
Cited by
8
Constant Delay Enumeration for Conjunctive Queries
Authors:
Luc Segoufin
Factorization Forests
Authors:
Mikołaj Bojanczyk
The Height of Factorization Forests
Authors:
Manfred Kufleitner
See all cited by