Synchronizing automata preserving a chain of partial orders
type: Item
instance of: scholarly article
title: Synchronizing automata preserving a chain of partial orders
zbMATH Open document ID: 1194.68148
published in: Theoretical Computer Science
publication date: 2009-09-14T00:00:00Z
full work available at URL: http://hdl.handle.net/10995/72269
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5603652
zbMATH Keywords: synchronizing automata
zbMATH Keywords: aperiodic automata
zbMATH Keywords: weakly monotonic automata
author: M. V. Volkov
MaRDI profile type: Publication
OpenAlex ID: W2009589430
cites work: Developments in Language Theory
cites work: Synchronizing generalized monotonic automata
cites work: Q5509690
cites work: Reset Sequences for Monotonic Automata
cites work: An extremal problem for two families of sets
cites work: Orienting polygonal parts without sensors
cites work: RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
cites work: Synchronizing finite automata on Eulerian digraphs.
cites work: Q4266486
cites work: Q5641083
cites work: On two Combinatorial Problems Arising from Automata Theory
cites work: Reset words for commutative and solvable automata
cites work: Composition sequences for functions over a finite domain.
cites work: Model-based testing of reactive systems. Advanced lectures.
cites work: Q5387708
cites work: Synchronizing Automata and the Černý Conjecture
DOI: 10.1016/J.TCS.2009.03.021
description: scientific article; zbMATH DE number 5603652