Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7798812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary and circular automata having maximal state complexity for the set of synchronizing words |
scientific article; zbMATH DE number 7798812 |
Statements
Binary and circular automata having maximal state complexity for the set of synchronizing words (English)
0 references
2 February 2024
0 references
finite automaton
0 references
binary automaton
0 references
synchronization
0 references
completely reachable automaton
0 references
state complexity
0 references
set of synchronizing words
0 references
0 references
0 references
