scientific article; zbMATH DE number 3639170

MaRDI QIDQ4198080zbMATH OpenFDO

Authors Bruno Courcelle

Publication date 1978

Full work available at URL https://eudml.org/doc/92084

zbMATH Keywords

derivation trees of context-free grammarsfrontiers of infinite treesinfinite wordsinitial object in the category of all solutionsword equations

Mathematics Subject Classification ID

Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Special categories (18B99) Formal languages and automata (68Q45)

Cites work

• A representation of trees by languages. II
• Generalized sequential machine maps
• scientific article; zbMATH DE number 3578343 (Why is no real title available?)
• scientific article; zbMATH DE number 3332047 (Why is no real title available?)
• Testing and generating infinite sequences by a finite automaton

Cited in

(25)

• A Mezei-Wright theorem for categorical algebras
• Fundamental properties of infinite trees
• Equational problems and disunification
• Varieties of chain-complete algebras
• Tree equivalence of linear recursive schemata is polynomial-time decidable
• Clique-width of countable graphs: A compactness property.
• Two equational theories of partial words
• The equational theory of regular words
• Infinite hypergraphs. I: Basic properties
• An undecidable property of context-free linear orders
• The ordinal generated by an ordinal grammar is computable
• MSO-definable properties of Muller context-free languages are decidable
• Regularity equals monadic second-order definability for quasi-trees
• Isomorphism of regular trees and words
• Tree Automata and Automata on Linear Orderings
• Continuous monoids and yields of infinite trees
• On frontiers of regular trees
• scientific article; zbMATH DE number 3675332 (Why is no real title available?)
• An algebraic approach to MSO-definability on countable linear orderings
• Axiomatizing omega and omega-op powers of words
• On systems of equations defining infinite graphs
• Büchi context-free languages
• Automating the stable rank computation for special biserial algebras
• On Müller context-free grammars
• Automata on linear orderings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198080)