The following pages link to (Q4198080):
Displaying 19 items.
- Büchi context-free languages (Q627181) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Automata on linear orderings (Q859978) (← links)
- A Mezei-Wright theorem for categorical algebras (Q1044831) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Equational problems and disunification (Q1124372) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
- Clique-width of countable graphs: A compactness property. (Q1422417) (← 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)
- MSO-definable Properties of Muller Context-Free Languages Are Decidable (Q2829973) (← links)
- Regularity Equals Monadic Second-Order Definability for Quasi-trees (Q2947169) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS (Q4692085) (← links)
- Axiomatizing omega and omega-op powers of words (Q4825384) (← links)
