Parallel construction of minimal suffix and factor automata (Q911778)
From MaRDI portal
!
WARNING
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 4143454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel construction of minimal suffix and factor automata |
scientific article; zbMATH DE number 4143454 |
Statements
Parallel construction of minimal suffix and factor automata (English)
0 references
1990
0 references
formal languages
0 references
finite automata
0 references
parallel agorithms
0 references
concurrent-write model
0 references
exclusive-write model
0 references
0 references
0.9071125984191896
0 references
0.8488735556602478
0 references
0.8190873861312866
0 references
0.7998024821281433
0 references
