Sequential?-Reference-Cited by-同舟云学术

Sequential?

Published:2006-05 Issue:1-2 Volume:356 Page:224-244
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Lombardy Sylvain,Sakarovitch Jacques

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference39 articles.

1. Efficient algorithms for testing the twins property;Allauzen;J. Automata, Languages Combin.,2003

2. Squaring transducers: an efficient procedure for deciding functionality and sequentiality;Béal;Theoret. Comput. Sci.,2003

3. M.-P. Béal, S. Lombardy, J. Sakarovitch, Conjugacy and equivalence of weighted automata and functional transducers, submitted for publication.

4. M.-P. Béal, S. Lombardy, J. Sakarovitch, On the equivalence of Z-automata, in: L. Caires (Ed.), ICALP, Lecture Notes in Computer Science, Vol. 3580, Springer, Berlin, 2005, pp. 397–409.

5. Transductions and Context-Free Languages;Berstel,1979

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

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

2. Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. On some decidability questions concerning supports of rational series;Information Processing Letters;2023-01

4. Polynomially Ambiguous Unary Weighted Automata over Fields;Theory of Computing Systems;2022-11-10

5. Determinisability of unary weighted automata over the rational numbers;Theoretical Computer Science;2022-01