Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords (Q4005339)
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 56445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords |
scientific article; zbMATH DE number 56445 |
Statements
Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords (English)
0 references
26 September 1992
0 references
comparison problems
0 references
finitely ambiguous sequence transducers on superwords
0 references
algorithmic solvability
0 references
0.7381759881973267
0 references
0.7365596294403076
0 references
0.7265841960906982
0 references
0.724735677242279
0 references
0.7235565781593323
0 references
