Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords (Q4005339): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:11, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords |
scientific article |
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
