scientific article; zbMATH DE number 7152073
From MaRDI portal
Publication:5208362
DOI10.25596/jalc-2019-119zbMath1427.68016MaRDI QIDQ5208362
No author found.
Publication date: 15 January 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items (6)
Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Completely distinguishable automata and the set of synchronizing words ⋮ Extremal Binary PFAs with Small Number of States ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ 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:
