Equivalence problems for transducers with a bounded number of states (Q1280978): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    15 March 1999
    0 references
    0 references
    sequential transducers
    0 references