Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators
We associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.
2021 ◽
Vol 28
(4)
◽
pp. 356-371
1992 ◽
Vol 03
(03)
◽
pp. 233-244
◽
Keyword(s):
1996 ◽
Vol 6
(4)
◽
pp. 353-373
◽
Keyword(s):
1991 ◽
Vol 83
(2)
◽
pp. 301-312
◽
1998 ◽
Vol 195
(2)
◽
pp. 183-203
◽
2010 ◽
Vol 20
(02)
◽
pp. 319-341
◽
2002 ◽
Vol 12
(5)
◽
pp. 839-859
◽