Languages recognized by a class of finite automata
We 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. This description is applied...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2001
|
| Sorozat: | Acta cybernetica
15 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12661 |
| LEADER | 01166nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12661 | ||
| 005 | 20220614125052.0 | ||
| 008 | 161015s2001 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Kelarev Andrej V. | |
| 245 | 1 | 0 | |a Languages recognized by a class of finite automata |h [elektronikus dokumentum] / |c Kelarev Andrej V. |
| 260 | |c 2001 | ||
| 300 | |a 45-52 | ||
| 490 | 0 | |a Acta cybernetica |v 15 No. 1 | |
| 520 | 3 | |a We 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. This description is applied to investigate closure properties of the obtained family of languages. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Algoritmus | ||
| 700 | 0 | 1 | |a Sokratova Olga V. |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12661/1/cybernetica_015_numb_001_045-052.pdf |z Dokumentum-elérés |