Recognizable and rational languages of finite and infinite traces (Q4035660)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizable and rational languages of finite and infinite traces |
scientific article; zbMATH DE number 176496 |
Statements
18 May 1993
0 references
concurrent systems
0 references
traces
0 references
syntactic congruence
0 references
recognizable languages
0 references
rational languages
0 references
closure properties
0 references
0.8874468803405762
0 references
0.8874468803405762
0 references
0.8741239905357361
0 references
0.8650119304656982
0 references
0.8647426962852478
0 references
Recognizable and rational languages of finite and infinite traces (English)
0 references
[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.
0 references
