Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference34 articles.
1. Finite Semigroups and Universal Algebra;Almeida,1994
2. A syntactic congruence for rational ω-languages;Arnold;Theoret. Comput. Sci.,1985
3. N. Bedon and O. Carton, An Eilenberg theorem for words on countable ordinals, in Latin'98: Theoretical Informatics, Campinas, Brazil, April 1998, Vol. 1380, pp. 53–64, (C. L. Lucchesi and A. V. Moura, Eds.), Springer-Verlag, Berlin/New York.
4. N. Bedon, Star-Free Sets of Words on Ordinals, Inform. and Comput, in press.
5. Automata, semigroups and recognizability of words on ordinals;Bedon;Internat. J. Algebra Comput.,1998
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献