On frontiers of regular trees

DOI10.1051/ITA/1986200403711MaRDI QIDQ3780462zbMATH OpenOpenAlexFDO

Authors Wolfgang Thomas

Publication date 1986

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

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

zbMATH Keywords

automata on infinite treesequivalence of countable word- or order-typesgeneralized wordsmodel theory of linear orderings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tree Automata and Automata on Linear Orderings
• scientific article; zbMATH DE number 2053214
• The equational theory of regular words
• scientific article; zbMATH DE number 4096786
• scientific article; zbMATH DE number 4208050

Cites work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• Fundamental properties of infinite trees
• scientific article; zbMATH DE number 3883631 (Why is no real title available?)
• scientific article; zbMATH DE number 3911742 (Why is no real title available?)
• scientific article; zbMATH DE number 3675332 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 3639170 (Why is no real title available?)
• On the elementary theory of linear order
• The monadic theory of order

Cited in

(24)

• 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
• Measure properties of regular sets of trees
• The isomorphism problem on classes of automatic structures with transitive relations
• Regularity equals monadic second-order definability for quasi-trees
• Isomorphism of regular trees and words
• scientific article; zbMATH DE number 3883631 (Why is no real title available?)
• Tree Automata and Automata on Linear Orderings
• scientific article; zbMATH DE number 3911742 (Why is no real title available?)
• scientific article; zbMATH DE number 2053214 (Why is no real title available?)
• Axiomatizing omega and omega-op powers of words
• scientific article; zbMATH DE number 1399513 (Why is no real title available?)
• scientific article; zbMATH DE number 7453084 (Why is no real title available?)
• Regular matching problems for infinite trees
• Order-theoretic Trees: Monadic Second-order Descriptions and Regularity
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Algebraic and logical descriptions of generalized trees
• A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
• On context-free languages of scattered words
• Büchi context-free languages
• Automata on linear orderings

This page was built for publication: On frontiers of regular trees

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