scientific article; zbMATH DE number 3639170
From MaRDI portal
Publication:4198080
zbMath0411.68065MaRDI QIDQ4198080
Publication date: 1978
Full work available at URL: https://eudml.org/doc/92084
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
infinite wordsword equationsderivation trees of context-free grammarsfrontiers of infinite treesinitial object in the category of all solutions
Formal languages and automata (68Q45) Special categories (18B99) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Related Items
Two equational theories of partial words, Automata on linear orderings, Axiomatizing omega and omega-op powers of words, Continuous monoids and yields of infinite trees, Equational problems and disunification, Unnamed Item, Regularity Equals Monadic Second-Order Definability for Quasi-trees, Varieties of chain-complete algebras, Büchi context-free languages, An undecidable property of context-free linear orders, On systems of equations defining infinite graphs, On frontiers of regular trees, Tree equivalence of linear recursive schemata is polynomial-time decidable, Clique-width of countable graphs: A compactness property., Isomorphism of Regular Trees and Words, The equational theory of regular words, AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS, Tree Automata and Automata on Linear Orderings, Infinite hypergraphs. I: Basic properties, MSO-definable Properties of Muller Context-Free Languages Are Decidable, On Müller context-free grammars, The ordinal generated by an ordinal grammar is computable, A Mezei-Wright theorem for categorical algebras, Fundamental properties of infinite trees
Cites Work
