Vectorial languages and linear temporal logic
From MaRDI portal
Publication:1884965
DOI10.1016/S0304-3975(03)00346-3zbMath1071.68051MaRDI QIDQ1884965
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
03B44: Temporal logic
Cites Work
- Families of recognizable sets corresponding to certain varieties of finite monoids
- On the expressive power of temporal logic
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
- The complexity of propositional linear temporal logics
- On finite monoids having only trivial subgroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item