Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) (Q1123986)
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 4110958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) |
scientific article; zbMATH DE number 4110958 |
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
0.7750983238220215
0 references
0.7640698552131653
0 references
0.756717324256897
0 references
