Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata (Q5390010)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata |
scientific article; zbMATH DE number 6027249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8410252928733826
0 references
0.8364253640174866
0 references
