Publication:3871942

zbMath0433.68062MaRDI QIDQ3871942

Stephan Heilbrunner

Publication date: 1980

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

zbMATH Keywords

algorithm; context-free grammars; fixed-point equations; shuffle operation; frontiers of infinite trees

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

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