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
38
views
2
references
Top references
cited by
13
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,334
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
An EILENBERG theorem for ∞-languages
other
Author(s):
Thomas Wilke
Publication date
(Online):
June 8 2005
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
African Languages
Most cited references
2
Record
: found
Abstract
: not found
Book Chapter
: not found
Factors of words
Daniele Beauquier
,
Jean-Éric Pin
(1989)
0
comments
Cited
7
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
On Recognizable Sets and Tree Automata
B. COURCELLE
(1989)
0
comments
Cited
4
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1991
Publication date (Online):
June 8 2005
Pages
: 588-599
DOI:
10.1007/3-540-54233-7_166
SO-VID:
9a886701-6e05-4742-9750-843cd6cb5fbb
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 267
Canonical sets of horn clauses
pp. 115
Model-checking for probabilistic real-time systems
pp. 127
Computing behavioural relations, logically
pp. 217
CCS + time = an interleaving model for real time systems
pp. 327
Computing shortest paths and distances in planar graphs
pp. 441
On logics, tilings, and automata
pp. 532
Finding minimal forbidden minors using a finite congruence
pp. 588
An EILENBERG theorem for ∞-languages
Similar content
1,334
$K$-theory of Eilenberg-Mac Lane spaces and cell-like mapping problem
Authors:
A. Dranishnikov
A Cartan–Eilenberg approach to homotopical algebra
Authors:
F. Guillén
,
V. Navarro
,
Pere Pascual
…
Kan extension and stable homology of eilenberg-mac lane spaces
Authors:
Teimuraz Pirashvili
See all similar
Cited by
13
Green’s Relations and Their Use in Automata Theory
Authors:
Thomas Colcombet
Logic, semigroups and automata on words
Authors:
Jean-Éric Pin
On logics, tilings, and automata
Authors:
Wolfgang Thomas
See all cited by