Minimal automaton for a factorial, transitive, and rational language (Q1822985): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3774986 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3687742 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3687740 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4079524 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sofic systems and graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3853827 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3769981 / rank | |||
Normal rank | |||
Latest revision as of 09:33, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal automaton for a factorial, transitive, and rational language |
scientific article |
Statements
Minimal automaton for a factorial, transitive, and rational language (English)
0 references
1989
0 references
A language is factorial if it contains all factors (i.e., subwords) of its words, and it is transitive if for any pair u, v of its words there exists a word w such that uwv is also in the language. A factorial, transitive, rational language is called an FTR-language. These languages can also be characterized as the languages recognizable by certain special finite automata for which the abbreviation ida is used. The author shows that every FTR-language has a minimal ida. Moreover, three ways of obtaining this minimal ida are presented.
0 references
syntactic monoids
0 references
finite automata
0 references
