Complexity of road coloring with prescribed reset words (Q2424693): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
Complexity of Road Coloring with Prescribed Reset Words
description / endescription / en
scientific article
scientific article; zbMATH DE number 6566775
Property / title
 
Complexity of Road Coloring with Prescribed Reset Words (English)
Property / title: Complexity of Road Coloring with Prescribed Reset Words (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1425.68235 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-15579-1_12 / rank
 
Normal rank
Property / published in
 
Property / published in: Language and Automata Theory and Applications / rank
 
Normal rank
Property / publication date
 
8 April 2016
Timestamp+2016-04-08T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 8 April 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6566775 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithms on automata and words
Property / zbMATH Keywords: algorithms on automata and words / rank
 
Normal rank
Property / zbMATH Keywords
 
road-coloring theorem
Property / zbMATH Keywords: road-coloring theorem / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TESTAS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2467775307 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1608413528 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.0799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of topological Markov shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete solution to the complexity of synchronizing road coloring for non-binary alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: P–NP Threshold for Synchronizing Road Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata with short reset words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the shortest reset words of synchronizing automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing automata preserving a chain of partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Inapproximability of the Shortest Reset Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic algorithm for road coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Road Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Synchronizing Colorings of Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups and the generalized road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multivariate Analysis of Some DFA Problems / rank
 
Normal rank

Latest revision as of 16:07, 19 July 2024

scientific article; zbMATH DE number 6566775
  • Complexity of Road Coloring with Prescribed Reset Words
Language Label Description Also known as
English
Complexity of road coloring with prescribed reset words
scientific article; zbMATH DE number 6566775
  • Complexity of Road Coloring with Prescribed Reset Words

Statements

Complexity of road coloring with prescribed reset words (English)
0 references
Complexity of Road Coloring with Prescribed Reset Words (English)
0 references
0 references
0 references
25 June 2019
0 references
8 April 2016
0 references
synchronizing word
0 references
reset word
0 references
road-coloring problem
0 references
synchronizing automata
0 references
Černý conjecture
0 references
algorithms on automata and words
0 references
road-coloring theorem
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references