Recognizable and rational languages of finite and infinite traces

From MaRDI portal





[For the entire collection see Zbl 0753.00019.] We introduce and study recognizable and rational languages of finite and infinite traces. We characterize recognizable languages by means of a syntactic congruence. We prove that the family of recognizable languages is strinctly included in the family of rational languages. Next, we study the closure properties of the family of recognizable languages. We prove that this family is closed under the Boolean operations and under concatenation. Contrary to the (finite) iteration, the infinite iteration of a finite trace is proved to be recognizable. We conclude with some open problems.




Cited in
(28)








This page was built for publication: Recognizable and rational languages of finite and infinite traces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035660)