Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata-Reference-Cited by-同舟云学术

Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata

Published:2019 Issue: Volume: Page:103-118
ISSN:1865-0929
Container-title:Mathematical Optimization Theory and Operations Research
language:
Short-container-title:

Author:

Shabana Hanan,Volkov Mikhail V.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-33394-2_9

Reference39 articles.

1. Lecture Notes in Computer Science;ÖF Altun,2017

2. Ananichev, D.S., Volkov, M.V.: Some results on Černý type problems for transformation semigroups. In: Araújo, I.M., Branco, M.J.J., Fernandes, V.H., Gomes, G.M.S. (eds.) Semigroups and Languages, pp. 23–42. World Scientific, Singapore (2004). https://doi.org/10.1142/9789812702616_0002

3. 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). https://doi.org/10.1007/s10958-013-1392-8

4. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2009). https://doi.org/10.1017/CBO9781139195768

5. Burkhard, H.-D.: Zum Längenproblem homogener Experimente an determinierten und nicht-deterministischen Automaten. Elektronische Informationsverarbeitung und Kybernetik 12, 301–306 (1976)

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

1. Careful synchronization of partial deterministic finite automata;Acta Informatica;2022-07-22

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