scientific article; zbMATH DE number 7152074
From MaRDI portal
Publication:5208363
DOI10.25596/jalc-2019-123zbMath1427.68140MaRDI QIDQ5208363
Publication date: 15 January 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach ⋮ Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Completely distinguishable automata and the set of synchronizing words ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ New characterizations of primitive permutation groups with applications to synchronizing automata ⋮ Synchronizing deterministic push-down automata can be really hard ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems
This page was built for publication:
