Synchronizing words under \textsf{LTL} constraints (Q6161453): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2023.106392 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4324370661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Synchronizing Words for Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of synchronizing Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / 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: The Cerny Conjecture Holds with High Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Data Words for Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial complete problems in automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / 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: An improvement to a recent upper bound for synchronizing words of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:29, 1 August 2024

scientific article; zbMATH DE number 7691951
Language Label Description Also known as
English
Synchronizing words under \textsf{LTL} constraints
scientific article; zbMATH DE number 7691951

    Statements

    Synchronizing words under \textsf{LTL} constraints (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2023
    0 references
    formal methods
    0 references
    finite-state automata
    0 references
    synchronizing words
    0 references
    temporal logic
    0 references

    Identifiers