Algebraic Ordinals

Authors:
Stephen L. Bloom;Zoltan Ésik
Affiliations:
Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ, USA. E-mail: bloom@cs.stevens.edu;Department of Informatics, University of Szeged, Szeged, Hungary. E-mail: ze@inf.u-szeged.hu
Venue:
Fundamenta Informaticae
Year:
2010

Citing 11
Cited 7

Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Long words: the theory of concatenation and &ohgr;-power

Theoretical Computer Science
Algebraic Semantics

Algebraic Semantics
Higher type program schemes and their tree languages

Proceedings of the 3rd GI-Conference on Theoretical Computer Science
Automatic Presentations of Structures

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
On Automatic Partial Orders

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Deciding whether the frontier of a regular tree is scattered

Fundamenta Informaticae
Collapsible Pushdown Automata and Recursion Schemes

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A Mezei-Wright theorem for categorical algebras

Theoretical Computer Science
Regular and algebraic words and ordinals

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Hierarchies of infinite structures generated by pushdown automata and recursion schemes

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Linear orders in the pushdown hierarchy

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
An undecidable property of context-free linear orders

Information Processing Letters
Scattered context-free linear orderings

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Hausdorff rank of scattered context-free linear orders

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Stephen L. Bloom 1940-2010

Fundamenta Informaticae
On context-free languages of scattered words

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A context-free linear ordering with an undecidable first-order theory

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algebraic tree T is one determined by a finite system of fixed point equations. The frontier Fr(T ) of an algebraic tree T is linearly ordered by the lexicographic order