z-logo
open-access-imgOpen Access
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
Author(s) -
A. N. Trahtman
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/11821069_68
Subject(s) - synchronizing , word (group theory) , finite state machine , deterministic finite automaton , automaton , state (computer science) , algorithm , sequence (biology) , combinatorics , upper and lower bounds , mathematics , computer science , discrete mathematics , succinctness , conjecture , reset (finance) , theoretical computer science , topology (electrical circuits) , biology , mathematical analysis , geometry , financial economics , economics , genetics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom