On the computational power of affine automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

On the computational power of affine automata

Résumé

We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] by showing that any affine language can be recognized by an AfA with certain limitation on the entries of affine states and transition matrices. Lastly, we present the first languages shown to be not recognized by AfAs with bounded-error.
Fichier principal
Vignette du fichier
main.pdf (404.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01908682 , version 1 (30-10-2018)

Licence

Paternité

Identifiants

Citer

Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz. On the computational power of affine automata. Language and Automata Theory and Applications, Mar 2017, Umeå, Sweden. ⟨10.1007/978-3-319-53733-7_30⟩. ⟨hal-01908682⟩
70 Consultations
85 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More