A series of slowly synchronizing automata with a zero state over a small alphabet
type: Item
instance of: scholarly article
title: A series of slowly synchronizing automata with a zero state over a small alphabet
zbMATH Open document ID: 1151.68029
author: P. V. Martugin
published in: Information and Computation
publication date: 2008-10-08T00:00:00Z
full work available at URL: http://hdl.handle.net/10995/72220
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5349808
zbMATH Keywords: synchronization
zbMATH Keywords: automata
zbMATH Keywords: reset words
MaRDI profile type: Publication
OpenAlex ID: W2030262845
cites work: Developments in Language Theory
cites work: SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
cites work: Synchronizing monotonic automata
cites work: Synchronizing generalized monotonic automata
cites work: Q5509690
cites work: Reset Sequences for Monotonic Automata
cites work: Synchronizing finite automata on Eulerian digraphs.
cites work: Q5684962
cites work: Reset words for commutative and solvable automata
cites work: Q5387708
DOI: 10.1016/J.IC.2008.03.020
description: scientific article; zbMATH DE number 5349808