Journal article
Languages recognized by two-sided automata of graphs/Graafide abil defineeritud kahepoolsete automaatide poolt aratuntavad keeled
Proceedings of the Estonian Academy of Sciences. Physics, mathematics., Vol.54(1), p.46
03/01/2005
Abstract
We introduce two-sided automata defined by directed graphs and describe all languages recognized by these automata. Key words: labelled graphs, finite state automata, formal languages. Kaesolevas artiklis on valjas uuritud kahepoolseid automaate, mis defineeritakse orienteeritud graafide abil. Kirjeldatakse koiki keeli, mis on nende automaatide abil aratuntavad.
Details
- Title: Subtitle
- Languages recognized by two-sided automata of graphs/Graafide abil defineeritud kahepoolsete automaatide poolt aratuntavad keeled
- Creators
- Andrei V KelarevMirka MillerOlga V Sokratova
- Resource Type
- Journal article
- Publication Details
- Proceedings of the Estonian Academy of Sciences. Physics, mathematics., Vol.54(1), p.46
- Publisher
- Estonian Academy Publishers
- ISSN
- 1406-0086
- Language
- English
- Date published
- 03/01/2005
- Description audience
- Academic
- Academic Unit
- Mathematics
- Record Identifier
- 9984242333102771
Metrics
2 Record Views