scientific article; zbMATH DE number 1834666
From MaRDI portal
Publication:4779162
zbMath0999.68108MaRDI QIDQ4779162
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360432
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (10)
An algorithm for road coloring ⋮ Synchronizing sequences for road colored digraphs ⋮ 2-Synchronizing Words ⋮ Černý conjecture for edge-colored digraphs with few junctions ⋮ Synchronizing monotonic automata ⋮ The road coloring problem ⋮ COMPAS - A Computing Package for Synchronization ⋮ Modifying the Upper Bound on the Length of Minimal Synchronizing Word ⋮ A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata ⋮ Sync-maximal permutation groups equal primitive permutation groups
This page was built for publication:
