On a reachability set of automaton counter machines
Properties of automaton counter machines are investigated. We prove that reachability sets of automaton one-counter machines are semilinear. An algorithm of construction of these semilinear reachability sets is resultexl. Besides, it is shown that reachability sets of reversal-boundexl automaton cou...
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Yaroslavl State University
2010-03-01
|
| coleção: | Моделирование и анализ информационных систем |
| Assuntos: | |
| Acesso em linha: | https://www.mais-journal.ru/jour/article/view/1020 |