Ideal regular languages and strongly connected synchronizing automata
type: Item
instance of: scholarly article
title: Ideal regular languages and strongly connected synchronizing automata
zbMATH Open document ID: 1453.68101
author: Rogério Reis
author: Emanuele Rodaro
published in: Theoretical Computer Science
publication date: 2016-10-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6642443
zbMATH Keywords: strongly connected synchronizing automaton
zbMATH Keywords: Černý's conjecture
zbMATH Keywords: reset word
zbMATH Keywords: ideal regular language
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.09.026
OpenAlex ID: W2529752804
cites work: Principal Ideal Languages and Synchronizing Automata
cites work: Finitely Generated Ideal Languages and Synchronizing Automata
cites work: Q4003737
cites work: On two Combinatorial Problems Arising from Automata Theory
cites work: Finitely Generated Synchronizing Automata
cites work: State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
cites work: Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete
cites work: State complexity of code operators
cites work: Synchronizing automata with finitely many minimal synchronizing words
cites work: Regular Ideal Languages and Synchronizing Automata
cites work: Q5509690
cites work: Synchronizing Automata and the Černý Conjecture
cites work: Synchronizing automata preserving a chain of partial orders
DOI: 10.1016/J.TCS.2016.09.026
description: scientific article; zbMATH DE number 6642443