Languages recognized by a class of finite automata (Q2770583)
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 1703959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Languages recognized by a class of finite automata |
scientific article; zbMATH DE number 1703959 |
Statements
13 February 2002
0 references
automata
0 references
combinatorial properties
0 references
formal languages
0 references
Languages recognized by a class of finite automata (English)
0 references
The authors consider automata defined by left multiplications in graph algebras and describe all languages recognized by these automata in terms of combinatorial properties of words which belong to these languages, regular expressions and linear grammars defining these languages.
0 references
0.8170933127403259
0 references
0.8110793232917786
0 references
0.7911468148231506
0 references
