The greatest fixed-points and rational omega-tree languages (Q1082091)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The greatest fixed-points and rational omega-tree languages |
scientific article; zbMATH DE number 3972222
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The greatest fixed-points and rational omega-tree languages |
scientific article; zbMATH DE number 3972222 |
Statements
The greatest fixed-points and rational omega-tree languages (English)
0 references
1986
0 references
Rational omega-tree languages are defined by extending the notion of rational (or regular) expressions for languages, and their properties are investigated. They are characterized by means of greatest fixed-points of certain functions, and are shown to be precisely the omega-tree languages recognized by Rabin's ''special automata''. A simple normal form for rational omega-tree languages is also presented.
0 references
Rabin's ''special automata''
0 references
normal form
0 references
0 references
0 references
0.8884527
0 references
0.88162804
0 references
0.8735113
0 references
0.8714137
0 references
0.87008995
0 references
0.8699205
0 references
