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 this page instead for the normal view: Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords |
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
