The Synchronizing Probability Function for Primitive Sets of Matrices-Reference-Cited by-同舟云学术

The Synchronizing Probability Function for Primitive Sets of Matrices

Published:2018 Issue: Volume: Page:194-205
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Catalano Costanza,Jungers Raphaël M.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-98654-8_16

Reference23 articles.

1. Alpin, Y.A., Alpina, V.S.: Combinatorial properties of entire semigroups of nonnegative matrices. J. Math. Sci. 207(5), 674–685 (2015)

2. Ananichev, D.S., Volkov, M.V., Gusev, V.V.: Primitive digraphs with large exponents and slowly synchronizing automata. J. Math. Sci. 192(3), 263–278 (2013)

3. Blondel, V.D., Jungers, R.M., Olshevsky, A.: On primitivity of sets of matrices. Automatica 61, 80–88 (2015)

4. Catalano, C., Jungers, R.M.: On randomized generation of slowly synchronizing automata. In: 43rd International Symposium on Mathematical Foundations of Computer Science (2018, to appear)

5. Chen, Y.B., Ierardi, D.J.: The complexity of oblivious plans for orienting and distinguishing polygonal parts. Algorithmica 14(5), 367–397 (1995)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices;Fundamenta Informaticae;2021-06-30

2. The Synchronizing Probability Function for Primitive Sets of Matrices;International Journal of Foundations of Computer Science;2020-09

3. A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices;Developments in Language Theory;2019