Improved upper bounds on synchronizing nondeterministic automata-Reference-Cited by-同舟云学术

Improved upper bounds on synchronizing nondeterministic automata

Published:2009-08 Issue:17 Volume:109 Page:986-990
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Gazdag Zsolt,Iván Szabolcs,Nagy-György Judit

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference12 articles.

1. Zum Längenproblem homogener Experimente an determinierten und nicht-deterministischen Automaten;Burkhard;Elektronische Informationsverarbeitung und Kybernetik, EIK,1976

2. A remark on homogenous experiments with finite automata;Černý;Mat.-Fyz. Časopis Sloven. Akad. Vied,1964

3. An extremal problem for two families of sets;Frankl;European J. Combin.,1982

4. Directable nondeterministic automata;Imreh;Acta Cybernet.,1999

5. On monotonic directable nondeterministic automata;Imreh;J. Autom. Lang. Comb.,2003

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

1. Accelerating Finite State Machine-Based Testing Using Reinforcement Learning;IEEE Transactions on Software Engineering;2024-03

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

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

4. Some Results Concerning Careful Synchronization of Partial Automata and Subset Synchronization of DFA’s;Implementation and Application of Automata;2022

5. Efficient state synchronisation in model-based testing through reinforcement learning;2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE);2021-11