Equivalence problems for transducers with a bounded number of states (Q1280978): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Equivalence of transducers relative to regular languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An undecidable problem for countable markov chains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5576254 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence problem for deterministic two-tape automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4366889 / rank | |||
Normal rank | |||
Latest revision as of 18:57, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence problems for transducers with a bounded number of states |
scientific article |
Statements
Equivalence problems for transducers with a bounded number of states (English)
0 references
15 March 1999
0 references
sequential transducers
0 references
