Monotonicity characterizations of regular languages

DOI10.1016/J.IC.2025.105360MaRDI QIDQ6884311zbMATH OpenFDO

Authors Yoav Feinstein, Orna Kupferman

Publication date 15 December 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2025.105360

zbMATH Keywords

automatamonotonicityomega-regular languagesprobabilityregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites work

• A Framework for Ranking Vacuity Results
• A very hard log-space counting class
• Codes and automata.
• Computational Complexity
• Convergence Rates for Markov Chains
• Efficient detection of vacuity in temporal model checking
• Finding State Solutions to Temporal Logic Queries
• scientific article; zbMATH DE number 6527944 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 7438576 (Why is no real title available?)
• scientific article; zbMATH DE number 7439745 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• scientific article; zbMATH DE number 3415406 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• Matrix Analysis
• Model checking of safety properties
• On the expressive power of temporal logic
• On the expressive power of temporal logic for infinite words
• Probabilities on finite models
• Safety, liveness and fairness in temporal logic
• Temporal Antecedent Failure: Refining Vacuity
• The Density of Linear-Time Properties
• The temporal semantics of concurrent programs

This page was built for publication: Monotonicity characterizations of regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884311)