Efficiency of automata in semi-commutation verification techniques (Q3515458): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OCaml / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003000560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation rewriting and algorithmic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4098669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of locally testable events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling literal morphisms by shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial approach to model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle on positive varieties of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4654642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity results for polynomial rational expressions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variétés de langages et opérations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite semigroup varieties of the form V*D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying regular events in symbolic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of finite monoids: the language approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Model Checking using Widening Techniques / rank
 
Normal rank

Latest revision as of 12:53, 28 June 2024

scientific article
Language Label Description Also known as
English
Efficiency of automata in semi-commutation verification techniques
scientific article

    Statements

    Efficiency of automata in semi-commutation verification techniques (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2008
    0 references
    image of a regular language
    0 references
    transitive closure
    0 references
    model checking
    0 references

    Identifiers

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