Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata (Q5390010): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1735667100 / rank | |||
Normal rank | |||
| Property / title | |||
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata (English) | |||
| Property / title: Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata (English) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:58, 30 July 2024
scientific article; zbMATH DE number 6027249
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata |
scientific article; zbMATH DE number 6027249 |
Statements
24 April 2012
0 references
min-plus automata
0 references
determinization
0 references
finite semigroups
0 references
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata (English)
0 references
