|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 3 of 22 found articles
| Title: |
A Note on the Logical Definability of Rational Trace Languages |
| Author: |
Choffrut, Christian |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 116 (2012) nr. 1-4 pages 45-50 |
| Year: |
2012-05-16 |
| Contents: |
The regular languages in the free monoid generated by a finite alphabet A are exactly the languages that are the models of some sentence of the second-order monadic logic of one successor and a unary predicate for each letter. For trace monoids the natural extension obtained by adapting the successor to the partial order underlying the traces is insufficient to capture the family of their rational subsets. We show that these subsets can be expressed by formulas of the form ∃Γφ where φ is a first-order formula over the structure of traces and Γ is an n-ary predicate semantically restricted, where n is the cardinality of the alphabet. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 3 of 22 found articles
| << previous | next >> |