Chapter

Developments in Language Theory

Volume 2450 of the series Lecture Notes in Computer Science pp 43-58

Date:

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators

  • Zoltán ÉsikAffiliated withDept. of Computer Science, University of Szeged

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.