Synchronizing words under \textsf{LTL} constraints

DOI10.1016/j.ipl.2023.106392OpenAlexW4324370661MaRDI QIDQ6161453

Hugo Francon, Nathalie Bertrand, Nicolas Markey

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106392

zbMATH Keywords

formal methodstemporal logicfinite-state automatasynchronizing words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• An extremal problem for two families of sets
• The complexity of synchronizing Markov decision processes
• Polynomial complete problems in automata theory
• Relationships between nondeterministic and deterministic tape complexities
• Infinite Synchronizing Words for Probabilistic Automata
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• Synchronizing Automata and the Černý Conjecture
• On two Combinatorial Problems Arising from Automata Theory
• The complexity of propositional linear temporal logics
• The Cerny Conjecture Holds with High Probability
• An improvement to a recent upper bound for synchronizing words of finite automata
• Synchronizing Data Words for Register Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronizing words under \textsf{LTL} constraints