Combinatorics on traces
Handbook of theoretical computer science (vol. B)
Logics For Context-Free Languages
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
| Hi-index | 0.00 |
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.