Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
35
views
20
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,575
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Algebraic Techniques
On Recognizable Sets and Tree Automata
edited-book
Author(s):
B. COURCELLE
Publication date
(Print):
1989
Publisher:
Elsevier
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
20
Record
: found
Abstract
: not found
Article
: not found
Finite Automata and Their Decision Problems
M. Rabin
,
Richard D Scott
(1959)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Data Types as Lattices
Dana Scott
(1976)
0
comments
Cited
61
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On Relations Defined by Generalized Finite Automata
J. E. Mezei
,
C. Elgot
(1965)
0
comments
Cited
44
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1989
Pages
: 93-126
DOI:
10.1016/B978-0-12-046370-1.50009-7
SO-VID:
541819ee-afd0-4060-9e9a-0ef858f7166c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 93
On Recognizable Sets and Tree Automata
Similar content
3,575
Inference of Event-Recording Automata Using Timed Decision Trees
Authors:
Olga Grinchtein
,
Bengt. Jonsson
,
Paul Pettersson
Control of cellular automata
Authors:
Raul Rechtman
,
Franco Bagnoli
,
Samira El Yacoubi
On real-time cellular automata and trellis automata
Authors:
C. Choffrut
,
K. Čulík
See all similar
Cited by
4
An EILENBERG theorem for ∞-languages
Authors:
Thomas Wilke
The monadic second-order logic of graphs : Definable sets of finite graphs
Authors:
Bruno Courcelle
Congruence based proofs of the recognizability theorems for free many-sorted algebras
Authors:
Juan Climent Vidal
,
Enric Llópez
See all cited by