Using SAT solvers for synchronization issues in non-deterministic automata
type: Item
instance of: scholarly article
title: Using SAT solvers for synchronization issues in non-deterministic automata
zbMATH Open document ID: 1411.68053
author: Hanan Shabana
author: M. V. Volkov
publication date: 2019-05-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1801.05391
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7052520
zbMATH Keywords: nondeterministic automaton
zbMATH Keywords: synchronizing word
zbMATH Keywords: SAT
zbMATH Keywords: SAT-solver
zbMATH Keywords: random automaton
describes a project that uses: MiniSat
describes a project that uses: CryptoMiniSat
describes a project that uses: Lingeling
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2997019898
cites work: Q4298260
cites work: Synchronizing Automata and the Černý Conjecture
cites work: Directable nondeterministic automata
cites work: A lower bound for the length of the shortest carefully synchronizing words
cites work: Algebraic Theory of Automata and Languages
cites work: On primitivity of sets of matrices
cites work: Primitive sets of nonnegative matrices and synchronizing automata
cites work: Synchronizing non-deterministic finite automata
cites work: On two Combinatorial Problems Arising from Automata Theory
cites work: Asymptotic estimate of the length of a diagnostic word for a finite automaton
cites work: Polynomial complete problems in automata theory
cites work: Synchronization of automata with one undefined or ambiguous transition
cites work: Q4036599
cites work: Experimental study of the shortest reset word of random automata
cites work: The complexity of finding reset words in finite automata
cites work: Theory and Applications of Satisfiability Testing
cites work: Experimental Evaluation of Classical Automata Constructions
cites work: Computing the shortest reset words of synchronizing automata
cites work: DFAs and PFAs with long shortest synchronizing word length
cites work: Lower bounds for synchronizing word lengths in partial automata
DOI: 10.17377/SEMI.2018.15.117
published in: Sibirskie Elektronnye Matematicheskie Izvestiya
Recommended article: \(D_2\)-synchronization in nondeterministic automata
Recommended article: Synchronizing non-deterministic finite automata
Recommended article: Experimental study of the shortest reset word of random automata
Recommended article: Minimising deterministic Büchi automata precisely using SAT solving
Recommended article: 2-Synchronizing Words
description: scientific article; zbMATH DE number 7052520