This survey paper serves two purposes: Firstly, we consider cycle-free algebraic systems (with respect to a given strong convergence) as a generalization of the usually considered proper systems (with respect to the discrete convergence). Secondly, we develop in a parallel manner the theory of these cycle-free algebraic systems over an arbitrary semiring and the theory of arbitrary algebraic systems over a continuous semiring. In both cases we prove that algebraic systems and weighted pushdown automata are mechanisms of equal power. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kuich, W. (2011). Algebraic systems and pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7020 LNCS, pp. 228–256). https://doi.org/10.1007/978-3-642-24897-9_11
Mendeley helps you to discover research relevant for your work.