Composition sequences for functions over a finite domain. (Q1853744): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4265623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3239817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5840116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4174248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset words for commutative and solvable automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem concerning the composition of functions of several variables ranging over a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3265658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731769 / rank
 
Normal rank

Latest revision as of 11:31, 5 June 2024

scientific article
Language Label Description Also known as
English
Composition sequences for functions over a finite domain.
scientific article

    Statements

    Composition sequences for functions over a finite domain. (English)
    0 references
    0 references
    22 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    Many-valued truth-functions
    0 references
    Length of compositions
    0 references
    Synchronizable automata
    0 references