Weighted Simple Reset Pushdown Automata - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2019

Weighted Simple Reset Pushdown Automata

Résumé

We define a new normal form for weighted pushdown automata. The new type of automaton uses a stack but has only limited access to it. Only three stack commands are available: popping a symbol, pushing a symbol or leaving the stack unaltered. Additionally, ε-transitions are not used. We prove that this automaton model can recognize all weighted context-free languages (i.e., generates all algebraic power series).
Fichier principal
Vignette du fichier
droste_dziadek_kuich-weighted_simple_reset_pushdown_automata-2019.pdf (263.22 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04732218 , version 1 (11-10-2024)

Identifiants

Citer

Manfred Droste, Sven Dziadek, Werner Kuich. Weighted Simple Reset Pushdown Automata. Theoretical Computer Science, 2019, 777, pp.252-259. ⟨10.1016/j.tcs.2019.01.016⟩. ⟨hal-04732218⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More