Unambiguous Automata Denoting Finitely Sequential Functions-Reference-Cited by-同舟云学术

Unambiguous Automata Denoting Finitely Sequential Functions

Published:2013 Issue: Volume: Page:104-115
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Bala Sebastian,Koniński Artur

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-37064-9_11

Reference12 articles.

1. Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics 8(2), 117–144 (2003)

2. Lecture Notes in Computer Science;C. Allauzen,2007

3. Aminof, B., Kupferman, O., Lampert, R.: Rigorous approximated determinization of weighted automata. In: LICS. pp. 345–354. IEEE Computer Society (2011)

4. Choffrut, C.: Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles. Theor. Comput. Sci. 5(3), 325–337 (1977)

5. Kirsten, D.: A burnside approach to the termination of mohri’s algorithm for polynomially ambiguous min-plus-automata. ITA 42(3), 553–581 (2008)

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

1. Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata;Theory of Computing Systems;2021-10-28

2. Finite Sequentiality of Unambiguous Max-Plus Tree Automata;Theory of Computing Systems;2021-03-26

3. A Pattern Logic for Automata with Outputs;International Journal of Foundations of Computer Science;2020-09

4. Register complexity and determinisation of max-plus automata;ACM SIGLOG News;2020-04-29

5. Finite Sequentiality of Unambiguous Max -Plus Tree Automata;2019