Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2018, Volume 15, Pages 1426–1442
DOI: https://doi.org/10.17377/semi.2018.15.117 (Mi semr1005) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Discrete mathematics and mathematical cybernetics

Using SAT solvers for synchronization issues in non-deterministic automata

H. Shabanaab, M. V. Volkovb

a Faculty of Electronic Engineering, Menoufia University, Egypt
b Institute of Natural Sciences and Mathematics, Ural Federal University, Lenina 51, 620000 Yekaterinburg, Russia
Full-text PDF (263 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.17377/semi.2018.15.117
Abstract: We approach the problem of computing a $D_{3}$-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver. We also present some experimental results.
Keywords: nondeterministic automaton, synchronizing word, SAT, SAT-solver, random automaton.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 1.3253.2017
Supported by the Ministry of Education and Science of the Russian Federation, project no. 1.3253.2017, and the Competitiveness Enhancement Program of Ural Federal University.
Received January 15, 2018, published November 15, 2018
Bibliographic databases:
Document Type: Article
UDC: 519.713.1, 510.633
MSC: 68Q45
Language: English
Citation: H. Shabana, M. V. Volkov, “Using SAT solvers for synchronization issues in non-deterministic automata”, Sib. Èlektron. Mat. Izv., 15 (2018), 1426–1442
Citation in format AMSBIB
\Bibitem{ShaVol18}
\by H.~Shabana, M.~V.~Volkov
\paper Using SAT solvers for synchronization issues in non-deterministic automata
\jour Sib. \`Elektron. Mat. Izv.
\yr 2018
\vol 15
\pages 1426--1442
\mathnet{http://mi.mathnet.ru/semr1005}
\crossref{https://doi.org/10.17377/semi.2018.15.117}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000454860200059}
Linking options:
  • https://www.mathnet.ru/eng/semr1005
  • https://www.mathnet.ru/eng/semr/v15/p1426
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:201
    Full-text PDF :45
    References:38
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024