An Eilenberg theorem for words on countable ordinals-Reference-Cited by-同舟云学术

An Eilenberg theorem for words on countable ordinals

Published:1998 Issue: Volume: Page:53-64
ISSN:0302-9743
Container-title:LATIN'98: Theoretical Informatics
language:
Short-container-title:

Author:

Bedon Nicolas,Carton Olivier

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0054310

Reference19 articles.

1. J. Almeida. Finite semigroups and universal algebra, volume 3 of Series in algebra. World Scientific, 1994.

2. A. Arnold. A syntactic congruence for rational Ω-languages. Theoretical Computer Science, 39:333–335, 1985.

3. N. Bedon. Automata, semigroups and recognizability of words on ordinals. IGM report 96-5, to appear in International Journal of Algebra and Computation.

4. N. Bedon. Star-free sets of words on ordinals. IGM report 97-8, submitted to Information and Computation.

5. J. R. Büchi. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 1–11. Stanford University Press, 1962.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. First-order separation over countable ordinals;Lecture Notes in Computer Science;2022

2. Equational Theories of Scattered and Countable Series-Parallel Posets;Developments in Language Theory;2020

3. Determinization of ordinal automata;Problems of Information Transmission;2013-04

4. A hierarchy of tree-automatic structures;The Journal of Symbolic Logic;2012-03

5. Schützenberger and Eilenberg theorems for words on linear orderings;Journal of Computer and System Sciences;2012-03