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
29
views
22
references
Top references
cited by
7
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,686
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Factors of words
other
Author(s):
Danièle Beauquier
,
Jean-Eric Pin
Publication date
(Online):
November 29 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
ScienceOpen Research
Most cited references
22
Record
: found
Abstract
: not found
Article
: not found
Testing and generating infinite sequences by a finite automaton
Robert McNaughton
(1966)
0
comments
Cited
19
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Classifying regular events in symbolic logic
Wolfgang Thomas
(1982)
0
comments
Cited
9
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Algebraic decision procedures for local testability
Robert McNaughton
(1974)
0
comments
Cited
6
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1989
Publication date (Online):
November 29 2005
Pages
: 63-79
DOI:
10.1007/BFb0035752
SO-VID:
f48491bd-14d8-4768-8bee-0503b8dfcece
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Realizable and unrealizable specifications of reactive systems
pp. 80
Asymptotically optimal distributed consensus
pp. 394
An improved algorithm for approximate string matching
pp. 451
Tensor rank is NP-complete
pp. 63
Factors of words
pp. 179
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
pp. 610
Shortest paths without a map
pp. 761
A note on model checking the modal v-calculus
Similar content
1,686
Was ein Wort bedeutet, kann ein Satz nicht sagen: Zur Bedeutung der Terminologiearbeit für die Technische Kommunikation und das Fachtextübersetzen
Translated title: The meaning of a word cannot be expressed in one sentence: The meaning of terminology for technical communication and the translation of technical texts
Authors:
Klaus-Dirk Schmitz
Effects of working memory load on processing of sounds and meanings of words in aphasia.
Authors:
Nadine C Martin
,
Francine Kohen
,
Michelene Kalinyak-Fliszar
…
A detailed review on word embedding techniques with emphasis on word2vec
Authors:
S JOHNSON
,
M. MURTY
,
I. Navakanth
See all similar
Cited by
7
An EILENBERG theorem for ∞-languages
Authors:
Thomas Wilke
Piecewise and Local Threshold Testability of DFA
Authors:
A. Trahtman
Regular Tree Languages Definable in FO
Authors:
Michael Benedikt
,
Luc Segoufin
See all cited by