Sur les automates circulaires et la conjecture de Černý
Open Access
- 1 January 1998
- journal article
- research article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 32 (1-3), 21-34
- https://doi.org/10.1051/ita/1998321-300211
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsThis publication has 6 references indexed in Scilit:
- Les automates circulaires biaisés vérifient la conjecture de ČernýRAIRO - Theoretical Informatics and Applications, 1996
- RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONSInternational Journal of Algebra and Computation, 1995
- Reset Sequences for Monotonic AutomataSIAM Journal on Computing, 1990
- On two Combinatorial Problems Arising from Automata TheoryNorth-Holland Mathematics Studies, 1983
- An Extremal Problem for two Families of SetsEuropean Journal of Combinatorics, 1982
- Sur un cas particulier de la conjecture de CernyLecture Notes in Computer Science, 1978