Revisiting the Equivalence Problem for Finite Multitape Automata-Reference-Cited by-同舟云学术

Revisiting the Equivalence Problem for Finite Multitape Automata

Published:2013 Issue: Volume: Page:422-433
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Worrell James

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-39212-2_38

Reference19 articles.

1. Amitsur, S.A., Levitzki, J.: Minimal identities for algebras. Proceedings of the American Mathematical Society 1, 449–463 (1950)

2. Lecture Notes in Computer Science;V. Arvind,2008

3. Bogdanov, A., Wee, H.: More on noncommutative polynomial identity testing. In: IEEE Conference on Computational Complexity, pp. 92–99. IEEE Computer Society (2005)

4. Cohn, P.M.: Further Algebra and Applications. Springer (2003)

5. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press (1974)

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

1. On Rational Recursion for Holonomic Sequences;Lecture Notes in Computer Science;2024

2. Revisiting Membership Problems in Subclasses of Rational Relations;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines;Automatic Control and Computer Sciences;2021-12

4. Polynomial algorithm for equivalence problem of deterministic multitape finite automata;Theoretical Computer Science;2020-09

5. On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers;International Journal of Foundations of Computer Science;2015-11