Complexity of some problems from the theory of automata (Q3740247)
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 3974308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of some problems from the theory of automata |
scientific article; zbMATH DE number 3974308 |
Statements
Complexity of some problems from the theory of automata (English)
0 references
1985
0 references
star-free events
0 references
finite automaton aperiodicity
0 references
dot depth one event recognition
0 references
piecewise testable event recognition
0 references
0.91101587
0 references
0.9073668
0 references
0.9029266
0 references
