On languages of automaton counter machines
Some properties of formal languages (ACML) of automaton counter machines are investigated. We show that a class of these languages is closed with respect to the following operations: union, intersection by regular sets, concatenation, infinite iteration (Kleene star), homomorphism and inverse homomo...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Yaroslavl State University
2010-06-01
|
| Seri Bilgileri: | Моделирование и анализ информационных систем |
| Konular: | |
| Online Erişim: | https://www.mais-journal.ru/jour/article/view/1029 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|