Vectorial languages and linear temporal logic
From MaRDI portal
Recommendations
Cites work
- Families of recognizable sets corresponding to certain varieties of finite monoids
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 1304310 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1949642 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On finite monoids having only trivial subgroups
- On the expressive power of temporal logic
- The complexity of propositional linear temporal logics
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
Cited in
(7)- Logspace and logtime leaf languages
- Linear future semantics and its implementation
- Real-time vector automata
- Hybrid languages and temporal logic
- scientific article; zbMATH DE number 1949642 (Why is no real title available?)
- scientific article; zbMATH DE number 761292 (Why is no real title available?)
- Cyclic vector languages
This page was built for publication: Vectorial languages and linear temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884965)