scientific article; zbMATH DE number 3266647
From MaRDI portal
Publication:5551185
zbMath0166.27003MaRDI QIDQ5551185
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
The Černý conjecture and 1-contracting automata ⋮ Unnamed Item ⋮ On synchronizing unambiguous automata ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ Synchronizing deterministic push-down automata can be really hard ⋮ Les automates circulaires biaisés vérifient la conjecture de Černý ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words ⋮ State complexity of the set of synchronizing words for circular automata and automata over binary alphabets ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Finding DFAs with Maximal Shortest Synchronizing Word Length ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Unnamed Item
This page was built for publication:
