Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
DLT
2009
favorite
Email
discuss
report
76
views
Theoretical Computer Science
»
more
DLT 2009
»
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
13 years 8 months ago
Download
www-igm.univ-mlv.fr
Cern
Marie-Pierre Béal, Dominique Perrin
Real-time Traffic
DLT 2009
|
N-state Deterministic Automaton
|
Quadratic Upper Bound
|
Synchronizing Word
|
Theoretical Computer Science
|
claim paper
Post Info
More Details (n/a)
Added
17 Feb 2011
Updated
17 Feb 2011
Type
Journal
Year
2009
Where
DLT
Authors
Marie-Pierre Béal, Dominique Perrin
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision