The following pages link to Finite automata and ordinals (Q1351785):
Displaying 15 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Büchi context-free languages (Q627181) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) (Q783293) (← links)
- Star-free sets of words on ordinals (Q1854423) (← links)
- Complementation of rational sets on scattered linear orderings of finite rank (Q2381522) (← links)
- MSO-definable Properties of Muller Context-Free Languages Are Decidable (Q2829973) (← links)
- Automata, Semigroups and Recognizability of Words on Ordinals (Q4354234) (← links)
- ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES (Q4652792) (← links)
- Axiomatizing omega and omega-op powers of words (Q4825384) (← links)
- OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs (Q5247171) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS (Q5462675) (← links)
- ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS (Q5495418) (← links)
- Locally finite languages (Q5941071) (← links)
