Logical equivalence between generalized urn models and finite automata (Q2505958): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58620651, #quickstatements; #temporary_batch_1707161894653
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Karl Svozil / rank
Normal rank
 
Property / author
 
Property / author: Karl Svozil / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105897744 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0209136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Physical versus computational complementarity. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaton logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224183 / rank
 
Normal rank

Latest revision as of 19:56, 24 June 2024

scientific article
Language Label Description Also known as
English
Logical equivalence between generalized urn models and finite automata
scientific article

    Statements

    Logical equivalence between generalized urn models and finite automata (English)
    0 references
    28 September 2006
    0 references
    computational complementarity
    0 references
    automation logic
    0 references
    generalized urn models
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references