External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets

Stefan Hoffmann. State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, editors, Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings. Volume 12638 of Lecture Notes in Computer Science, pages 318-330, Springer, 2021. [doi]

Abstract

Abstract is missing.

runs on