Binary and circular automata having maximal state complexity for the set of synchronizing words

Title
Binary and circular automata having maximal state complexity for the set of synchronizing words
Authors
Keywords
-
Journal
INFORMATION AND COMPUTATION
Volume -, Issue -, Pages 105076
Publisher
Elsevier BV
Online
2023-08-01
DOI
10.1016/j.ic.2023.105076

Ask authors/readers for more resources

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now