Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Generating Synchronizing Automata with L...

Kisielewicz, Andrzej...

Free

Share this content

Generating Synchronizing Automata with Large Reset Lengths by Kisielewicz, Andrzej ( Author )

Content Provider	Lemonjar Open Access
Publisher	Australian National University
Publication Date	01-09-2023
Summary	We study synchronizing automata with the shortest reset words of relatively large length. First, we refine the Frankl-Pin result on the length of the shortest words of rank $m$, and the B\'eal, Berlinkov, Perrin, and Steinberg results on the length of the shortest reset words in one-cluster automata. The obtained results are useful in computation aimed in extending the class of small automata for which the \v{C}ern\'y conjecture is verified and discovering new automata with special properties regarding synchronization.
ISBN	-
Item Type	Article
File Type	pdf
File Size	29.34 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1404.3311

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Kisielewicz, Andrzej. Generating Synchronizing Automata with Large Reset Lengths. Australian National University. September 01, 2023. Accessed September 20, 2024. https://online.provdatabase.com/cite/23332

APA 7th EditionReferences

Kisielewicz, Andrzej. (2023). Generating Synchronizing Automata with Large Reset Lengths. Australian National University. https://online.provdatabase.com/cite/23332

Chicago 17th EditionReferences

Kisielewicz, Andrzej. Generating Synchronizing Automata with Large Reset Lengths. Australian National University. 2023. https://online.provdatabase.com/cite/23332

HarvardReferences

Kisielewicz, Andrzej. (2023). Generating Synchronizing Automata with Large Reset Lengths. [Online]. Australian National University. Available from: https://online.provdatabase.com/cite/23332. (Accessed 20 September 2024).

Harvard AustraliaReferences

Kisielewicz, Andrzej, 2023, Generating Synchronizing Automata with Large Reset Lengths, Australian National University, viewed 20 September 2024, <https://online.provdatabase.com/cite/23332>

MLA 9th EditionWorks Cited

Kisielewicz, Andrzej. Generating Synchronizing Automata with Large Reset Lengths. Australian National University, 2023. PROV Database, https://online.provdatabase.com/cite/23332.

Share this eBook