On the trace product and some families of languages closed under partial commutations

Authors:
Giovanna Guaiana;Antonio Restivo;Sergio Salemi
Affiliations:
Dépt. Informatique-LIFAR, Faculté des Sciences et Techniques, Université de Rouen, Place Émile Blondel, F-76821 Mont-Saint-Aignan Cedex, France;Dipartimento di Matematica e Applicazioni, Università di Palermo, Via Archirafi 34, I-90123 Palermo (PA), Italy;Dipartimento di Matematica e Applicazioni, Università di Palermo, Via Archirafi 34, I-90123 Palermo (PA), Italy
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2004

Citing 11
Cited 3

Recognizable closures and submonoids of free partially commutative monoids

Theoretical Computer Science
Polynomial operations and hierarchies of concatenation (in French)

Theoretical Computer Science
Local languages and the Berry-Sethi algorithm

Theoretical Computer Science
Regular languages

Handbook of formal languages, vol. 1
Syntactic semigroups

Handbook of formal languages, vol. 1
Partial commutation and traces

Handbook of formal languages, vol. 3
The Book of Traces

The Book of Traces
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Varieties Of Formal Languages

Varieties Of Formal Languages
Computing the Closure of Sets of Words Under Partial Commutations

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Piecewise testable events

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages

Preface

Theoretical Computer Science - The art of theory
When Does Partial Commutative Closure Preserve Regularity?

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Regular languages and partial commutations

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

New automata-theoretic constructions for the product of recognizable trace languages are given. This study leads to investigate the effect of partial (and total) commutations on some families of recognizable languages (the Straubing-Thérien's hierarchy of star-free languages).