Rational and Recognisable Power Series-Reference-Cited by-同舟云学术

Rational and Recognisable Power Series

Published:2009 Issue: Volume: Page:105-174
ISSN:1431-2654
Container-title:Monographs in Theoretical Computer Science
language:
Short-container-title:

Author:

Sakarovitch Jacques

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-01492-5_4.pdf

Reference52 articles.

1. V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science, 155:291–319, 1996.

2. A. Arnold. Systèmes de transitions finis et sémantique des processus communiquants. Masson, Paris, 1992. Translation: Finite Transitions Systems. Prentice–Hall, New York, 1994.

3. Lecture Notes in Computer Science;M.-P. Béal,2005

4. Lecture Notes in Computer Science;M.-P. Béal,2006

5. J. Berstel and C. Reutenauer. Les séries rationnelles et leurs langages. Masson, Paris, 1984. Translation: Rational Series and Their Languages. Springer, Berlin, 1988. New revised English edition available from http://www-igm.univ-mlv.fr/~berstel/ .

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

1. Weighted automata and logics meet computational complexity;Information and Computation;2024-12

2. Decorated one-dimensional cobordisms and tensor envelopes of noncommutative recognizable power series;Journal of Pure and Applied Algebra;2024-11

3. Finitely ambiguous and finitely sequential weighted automata over fields;Theoretical Computer Science;2024-10

4. Bideterministic weighted automata;Information and Computation;2023-12

5. Weighted Linear Dynamic Logic;International Journal of Foundations of Computer Science;2023-11-16