Cerny's conjecture for automata with simple idempotents (Q2132068): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5509690 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4171566 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reset Sequences for Monotonic Automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Černý conjecture for one-cluster automata with prime length cycle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Almost optimal bound of recurrent word length for regular automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Estimation of the length of reset words for automata with simple idempotents / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3218140 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Černý's conjecture and group representation theory / rank | |||
Normal rank |
Latest revision as of 19:19, 28 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cerny's conjecture for automata with simple idempotents |
scientific article |
Statements
Cerny's conjecture for automata with simple idempotents (English)
0 references
27 April 2022
0 references
finite automata
0 references
Černy's conjecture
0 references