arXiv Open Access 2017

A new lower bound for reset threshold of synchronizing automata with sink state

Dmitry Ananichev

Lihat Sumber

Abstrak

We present a new series of examples of binary slowly synchronizing automata with sink state. The reset threshold of the $n$-state automaton in this series is $\frac{n^2}{4}+2n-9$. This improves on the previously known lower bound for the maximum reset threshold of binary synchronizing $n$-state automata with sink state.

Topik & Kata Kunci

cs.FL

Penulis (1)

Dmitry Ananichev

Format Sitasi

APA MLA BibTeX

Ananichev, D. (2017). A new lower bound for reset threshold of synchronizing automata with sink state. https://arxiv.org/abs/1701.07954

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓