The greatest fixed-points and rational omega-tree languages (Q1082091): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(86)90123-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067751623 / rank | |||
Normal rank | |||
Revision as of 23:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The greatest fixed-points and rational omega-tree languages |
scientific article |
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
