Automata linear dynamic logic on finite traces

DOI10.46298/LMCS-21(3:2)2025MaRDI QIDQ6925638zbMATH OpenFDO

Authors Kevin W. Smith, Moshe Y. Vardi

Publication date 25 September 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(3:2)2025

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• Alternation in two-way finite automata
• From finite automata to regular expressions and back -- a summary on descriptional complexity
• scientific article; zbMATH DE number 3129315 (Why is no real title available?)
• scientific article; zbMATH DE number 1304310 (Why is no real title available?)
• Programming Techniques: Regular expression search algorithm
• Propositional dynamic logic of regular programs
• Relationships between nondeterministic and deterministic tape complexities
• Tight Bounds on the Descriptional Complexity of Regular Expressions
• Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata

This page was built for publication: Automata linear dynamic logic on finite traces

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