In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton-Reference-Cited by-同舟云学术

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

Published:1987 Issue:2 Volume:23 Page:165-171
ISSN:0011-4235
Container-title:Cybernetics
language:en
Short-container-title:Cybern Syst Anal

Author:

Klyachko A. A.,Rystsov I. K.,Spivak M. A.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01071771.pdf

Reference10 articles.

1. M. Fishler and M. Tanenbaum, ?Synchronizing and representation problems for sequential machines with masked outputs,? IEEE Conf. Record, 11th Ann. Symp. Switching and Automata Theory, New York (1970), pp. 97?103.

2. Z. Kohavi and J. Winograd, ?Establishing certain bounds concerning finite automata,? J. Computer System Sci.,7, No. 2, 288?299 (1973).

3. G. Katona, ?Solution of a problem of Erenfeucht-Mycielski,? J. Comb. Theory (A),17, No. 2, 265?266 (1974).

4. I. K. Rystsov and M. A. Spivak, ?Investigation of irredundant sequences of sets,? in: Mathematical Theory of Computer Design [in Russian], IK AN UkrSSR, Kiev (1978), pp. 13?27.

5. A. G. Kurosh, A Course in Higher Algebra [in Russian], Nauka, Moscow (1976).

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

1. Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees;International Journal of Foundations of Computer Science;2023-07-14

2. Синхронизация конечных автоматов;Uspekhi Matematicheskikh Nauk;2022

3. Synchronization of finite automata;Russian Mathematical Surveys;2022

4. On the Interplay Between Černý and Babai’s Conjectures;International Journal of Foundations of Computer Science;2019-01

5. Words of Minimum Rank in Deterministic Finite Automata;Developments in Language Theory;2019