On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility (Q1239135): 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: Q5672582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5633929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5335319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799732 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:32, 12 June 2024

scientific article
Language Label Description Also known as
English
On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility
scientific article

    Statements

    On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility (English)
    0 references
    0 references
    1977
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references