Paper Info
Title
A star operation for star-free trace languages
Abstract
The paper deals with star-free languages in trace monoids. We define a constrained star operation, named star-free star, and show a new characterisation of star-free trace languages, using this operation instead of complement. We obtain this characterisation combining a star-free star characterisation for word languages and logical characterisation of trace languages (Ebinger/Muscholl). Moreover, some new, simple proofs of known results are presented in the paper.
Year
DOI
Venue
2007
10.1007/978-3-540-73208-2_32
Developments in Language Theory
Keywords
Field
DocType
star-free trace language,star operation,new characterisation,paper deal,trace language,star-free star,logical characterisation,star-free language,trace monoids,star-free star characterisation
Discrete mathematics,Programming language,Computer science,Monoid,Mathematical proof,A* search algorithm
Conference
Volume
ISSN
Citations 
4588
0302-9743
3
PageRank 
References 
Authors
0.42
10
2
Name
Order
Citations
PageRank
Edward Ochmanski118520.46
Krystyna Stawikowska291.72