Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
DOI10.1137/S0097539797322772zbMath1001.03018OpenAlexW2095996785MaRDI QIDQ2784480
Publication date: 23 April 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539797322772
semidirect productsfinite semigroupspseudovarieties of semigroupslinear temporal logicsubstitutionaperiodic semigroupsuntil hierarchy
Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35) Temporal logic (03B44)
Related Items (6)
This page was built for publication: Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy