scientific article; zbMATH DE number 194781
From MaRDI portal
zbMath0715.68062MaRDI QIDQ4692772
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
homomorphismsfinite automatatree automatapush-down automataabstract algebraparsingunary algebrasLR(k) grammarsarbitrary algebrasFinite automata, their algebras and grammars
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)
Related Items
On algebraic and logical specifications of classes of regular languages., The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey, The modernity of Dedekind's anticipations contained in \textit{What are numbers and what are they good for?}, The origins of combinatorics on words, First-order logic on finite trees, Monadic logic programs and functional complexity, Classifying regular languages by their syntactic algebras, The presence of lattice theory in discrete problems of mathematical social sciences. Why., Complexity results for prefix grammars, Deleting string rewriting systems preserve regularity, The Reachability Problem over Infinite Graphs, A congruence-based perspective on automata minimization algorithms, General varieties of tree languages, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, Series-parallel languages and the bounded-width property, Re-describing an algorithm by Hopcroft, Uniform and nonuniform recognizability., Rationality in algebras with a series operation
