Algebraic ordinals

DOI10.3233/FI-2010-255zbMATH Open1208.68152OpenAlexW4254972006MaRDI QIDQ4932074FDOQ4932074

Authors: Stephen L. Bloom, Zoltán Ésik 

Publication date: 1 October 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-255

Recommendations

• Algebraic linear orderings
• New Computational Paradigms
• On better quasi-ordering countable trees
• Algebraic properties of \(\omega\)-trees. II
• The isomorphism problem for tree-automatic ordinals with addition

zbMATH Keywords

frontieralgebraic treealgebraic ordinal

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15) Ordinal and cardinal numbers (03E10)

Cited In (8)

• The ordinal generated by an ordinal grammar is computable
• A note on ordinal DFAs
• Algebraic linear orderings
• AN ORDINAL VERSION OF THE FUNDAMENTAL LAW OF ALGEBRA
• An undecidable property of context-free linear orders
• Title not available (Why is that?)
• Title not available (Why is that?)
• The order type of scattered context-free orderings of rank one is computable

This page was built for publication: Algebraic ordinals

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