scientific article

zbMath0433.68062MaRDI QIDQ3871942

Stephan Heilbrunner

Publication date: 1980

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmcontext-free grammarsfixed-point equationsshuffle operationfrontiers of infinite trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Order-theoretic Trees: Monadic Second-order Descriptions and Regularity ⋮ Automata on linear orderings ⋮ Axiomatizing omega and omega-op powers of words ⋮ Continuous monoids and yields of infinite trees ⋮ Regularity Equals Monadic Second-Order Definability for Quasi-trees ⋮ Büchi context-free languages ⋮ A note on ordinal DFAs ⋮ An undecidable property of context-free linear orders ⋮ On frontiers of regular trees ⋮ Unnamed Item ⋮ The Order Type of Scattered Context-Free Orderings of Rank One Is Computable ⋮ Isomorphism of Regular Trees and Words ⋮ The equational theory of regular words ⋮ Tree Automata and Automata on Linear Orderings ⋮ Infinite hypergraphs. I: Basic properties ⋮ On Müller context-free grammars ⋮ The ordinal generated by an ordinal grammar is computable ⋮ Fundamental properties of infinite trees

Uses Software

• ALGOL 68

Cites Work

• Foundations of set theory. With the collaboration of Dirk van Dalen. 2nd revised ed
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: