Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) (Q1123986)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) |
scientific article |
Statements
Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) (English)
0 references
1989
0 references
The author generalizes finite automata to include multiple accepting state sets and thus obtains an automaton to accept families of regular languages. The syntactic monoid of such families is studied and it is proved that every finite monoid is such a syntactic monoid.
0 references
finite automata
0 references
state sets
0 references
regular languages
0 references
syntactic monoid
0 references
finite monoid
0 references
