Equivalence problems for transducers with a bounded number of states (Q1280978): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02733223 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2093874952 / rank | |||
Normal rank |
Latest revision as of 12:16, 30 July 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