A Kleene theorem for weighted ω-pushdown automata
Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata accepting infinite words by Büchi acceptance. The main result in the proof of the Kleene Theorem is the construction of a weighted ω-pushdown automaton for the ω-algebraic closure of subsets of a contin...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
2017
|
| Series: | Acta cybernetica
23 No. 1 |
| Kulcsszavak: | Automaták elmélete - véges, Algebra, Véges automaták, Matematikai logika, Stephen Cole Kleene |
| Subjects: | |
| doi: | 10.14232/actacyb.23.1.2017.4 |
| Online Access: | http://acta.bibl.u-szeged.hu/50062 |
| Summary: | Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata accepting infinite words by Büchi acceptance. The main result in the proof of the Kleene Theorem is the construction of a weighted ω-pushdown automaton for the ω-algebraic closure of subsets of a continuous star-omega semiring. |
|---|---|
| Physical Description: | 43-59 |
| ISSN: | 0324-721X |