Reset words for commutative and solvable automata
type: Item
instance of: scholarly article
title: Reset words for commutative and solvable automata
zbMATH Open document ID: 0903.68122
DOI: 10.1016/S0304-3975(96)00136-3
author: Igor Rystsov
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1178700
zbMATH Keywords: reset word
zbMATH Keywords: finite automaton
MaRDI profile type: Publication
cites work: Reset Sequences for Monotonic Automata
cites work: Q5186741
cites work: Q4852888
cites work: In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
cites work: Q5588717
cites work: The Theory of Definite Automata
cites work: Q4171566
cites work: Q4884899
description: scientific article; zbMATH DE number 1178700