Continuous monoids and yields of infinite trees

DOI10.1051/ita/1986200302511zbMath0605.06012OpenAlexW36587962MaRDI QIDQ3743357

E. Timmerman, Max Dauchet

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

infinite treesrational languageset of wordsmonoid with partial ordertree alphabetyield of regular trees

Mathematics Subject Classification ID

Trees (05C05) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Ordered semigroups and monoids (06F05)

Related Items (3)

Continuous monoids and yields of infinite trees ⋮ AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS ⋮ Infinite hypergraphs. I: Basic properties

Cites Work

• Fundamental properties of infinite trees
• Continuous monoids and yields of infinite trees
• Infinite trees in normal form and recursive equations having a unique solution
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous monoids and yields of infinite trees