Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords (Q4005339): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Equivalence problems for mappings on infinite strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strict sets and finite semigroup coverings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5590810 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4168600 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Testing and generating infinite sequences by a finite automaton / rank | |||
Normal rank | |||
Revision as of 11:52, 16 May 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
