Vectorial languages and linear temporal logic (Q1884965): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4412565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of recognizable sets corresponding to certain varieties of finite monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251040 / rank
 
Normal rank

Revision as of 14:51, 7 June 2024

scientific article
Language Label Description Also known as
English
Vectorial languages and linear temporal logic
scientific article

    Statements

    Vectorial languages and linear temporal logic (English)
    0 references
    0 references
    27 October 2004
    0 references
    Parallel automata simulation
    0 references
    Linear temporal logic and extensions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references