Decision procedures for inductive Boolean functions based on alternating automata (Q1399969): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: David A. Basin / rank
Normal rank
 
Property / author
 
Property / author: David A. Basin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MONA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the space complexity of some decision problems for finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results concerning systolic tree automata and E0L languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata / rank
 
Normal rank

Revision as of 18:55, 5 June 2024

scientific article
Language Label Description Also known as
English
Decision procedures for inductive Boolean functions based on alternating automata
scientific article

    Statements

    Decision procedures for inductive Boolean functions based on alternating automata (English)
    0 references
    0 references
    0 references
    0 references
    30 July 2003
    0 references
    0 references
    Alternating automaton
    0 references
    inductive Boolean function
    0 references
    verification
    0 references
    parameterized
    0 references
    circuit
    0 references