Computational complexity of synchronization under regular commutative constraints
type: Item
instance of: scholarly article
title: Computational complexity of synchronization under regular commutative constraints
DOI: 10.1007/978-3-030-58150-3_37
author: Stefan Hoffmann
publication date: 2021-04-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2005.04042
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336126
zbMATH Keywords: constrained synchronization
zbMATH Keywords: computational complexity
zbMATH Keywords: automata theory
zbMATH Keywords: commutative language
MaRDI profile type: Publication
OpenAlex ID: W3105271807
cites work: Q5509690
cites work: Semicomputable points in Euclidean spaces
cites work: Q5208373
cites work: Learning Commutative Regular Languages
cites work: Synchronizing Automata of Bounded Rank
cites work: Commutative regular languages -- properties and state complexity
cites work: Q4506483
cites work: Synchronization of Automata with One Undefined or Ambiguous Transition
cites work: Synchronizing Automata and the Černý Conjecture
description: scientific article; zbMATH DE number 7336126