Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Bicentres de langages algébriques;Autebert;Acta Inform.,1984
2. Bilimites de langages reconnaissables;Beauquier;Theoret. Comput. Sci.,1984
3. Ensembles reconnaissables de mots biinfinis;Beauquier;Rapport L.I.T.P. no. 84-57,1984
4. Adhérences of languages;Boasson;J. Comput. System Sci.,1980
5. On the centers of a language;De Luca;Theoret. Comput. Sci.,1983
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounded satisfiability checking of metric temporal logic specifications;ACM Transactions on Software Engineering and Methodology;2013-07
2. The modular decomposition of countable graphs. Definition and construction in monadic second-order logic;Theoretical Computer Science;2008-03
3. References;Infinite Words - Automata, Semigroups, Logic and Games;2004
4. Learning of Regular Bi-ω Languages;Grammatical Inference: Algorithms and Applications;2002
5. Codes générateurs minimaux de langages de mots bi-infinis;RAIRO - Theoretical Informatics and Applications;2000-11