Rich Craig A. and Slutzki Giora: The complexity of a counting finite state automaton. In: Acta cybernetica, (9) 4. pp. 403-417. (1990)
Preview |
Cikk, tanulmány, mű
cybernetica_009_numb_004_403-417.pdf Download (794kB) | Preview |
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1990 |
| Volume: | 9 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 403-417 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38492/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 416-417. |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:27 |
| Last Modified: | 2022. Jun. 10. 15:47 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12484 |
Actions (login required)
 |
View Item |
