A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ita:2008017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ITA:2008017 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata |
scientific article |
Statements
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (English)
0 references
25 September 2008
0 references
0 references
0 references
