The following pages link to On frontiers of regular trees (Q3780462):
Displaying 16 items.
- Büchi context-free languages (Q627181) (← links)
- Automata on linear orderings (Q859978) (← links)
- Two equational theories of partial words (Q1643141) (← links)
- The equational theory of regular words (Q1776401) (← links)
- Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
- An undecidable property of context-free linear orders (Q1944046) (← links)
- The ordinal generated by an ordinal grammar is computable (Q2326394) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Regularity Equals Monadic Second-Order Definability for Quasi-trees (Q2947169) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- Tree Automata and Automata on Linear Orderings (Q3625696) (← links)
- Axiomatizing omega and omega-op powers of words (Q4825384) (← links)
- (Q5020534) (← links)
- Order-theoretic Trees: Monadic Second-order Descriptions and Regularity (Q5038567) (← links)
- A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS (Q5483372) (← links)
- ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS (Q5495418) (← links)
