Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata-Reference-Cited by-同舟云学术

Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata

Published:2013-11-14 Issue:2 Volume:54 Page:293-304
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Martyugin Pavel

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-013-9516-6.pdf

Reference16 articles.

1. Burkhard, H.-D.: Zum Längenproblem homogener Experimente an determinierten und nicht-deterministischen Automaten. Elektron. Inf.verarb. Kybern. 12, 301–306 (1976) (in German)

2. Černý, J.: Poznámka k homogénnym experimentom s konečnými automatmi. Mat.-Fyz. Cas. Slov. Akad. Vied 14, 208–216 (1964) (in Slovak)

3. Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)

4. Gazdag, Z., Iván, S., Nagy-György, J.: Improved upper bounds on synchronizing nondeterministic automata. Inf. Process. Lett. 109, 986–990 (2009)

5. Imreh, B., Steinby, M.: Directable nondeterministic automata. Acta Cybern. 14, 105–115 (1999)

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

1. Careful Synchronization of One-Cluster Automata;Lecture Notes in Computer Science;2024

2. Synchronizing deterministic push-down automata can be really hard;Information and Computation;2023-12

3. Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach;SIAM Journal on Matrix Analysis and Applications;2023-03-10

4. Distributed graph problems through an automata-theoretic lens;Theoretical Computer Science;2023-03

5. Synchronization of Parikh Automata;Developments in Language Theory;2023