zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Algebraic systems and pushdown automata. (English) Zbl 1251.68135
Kuich, Werner (ed.) et al., Algebraic foundations in computer science. Essays dedicated to Symeon Bozapalidis on the occasion of his retirement. Berlin: Springer (ISBN 978-3-642-24896-2/pbk). Lecture Notes in Computer Science 7020, 228-256 (2011).
Summary: 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. For the entire collection see [Zbl 1225.68022].
MSC:
68Q45Formal languages and automata
68Q42Grammars and rewriting systems
68Q70Algebraic theory of languages and automata
WorldCat.org
Full Text: DOI