Undecidability of state complexity-Reference-Cited by-同舟云学术

Undecidability of state complexity

Published:2013-06 Issue:6 Volume:90 Page:1310-1320
ISSN:0020-7160
Container-title:International Journal of Computer Mathematics
language:en
Short-container-title:International Journal of Computer Mathematics

Author:

Salomaa Arto,Salomaa Kai,Yu Sheng

Publisher

Informa UK Limited

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications

Link

http://www.tandfonline.com/doi/pdf/10.1080/00207160.2012.704994

Reference34 articles.

1. Bouchou-Markhoff, B., Caron, P., Champarnaud, J.M. and Maurel, D. Implementation and Application of Automata – 16th International Conference. Edited by: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.M. and Maurel, D. CIAA’11, Blois, France, July 12–16, 2011, LNCS Vol. 6807, Springer, y2011.

2. Campeanu, C., Culik, K., Salomaa, K. and Yu, S. State complexity of basic operations on finite language. Proceedings of the Fourth International Workshop on Implementing Automata. July17–191999, Potsdam, Germany. pp.60–70. Springer. LNCS Vol. 2214

3. Cui, B., Gao, Y., Kari, L. and Yu, S. State complexity of catenation combined with union and intersection. Proceedings of CIAA 2010. Winnipeg.

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

1. Arto Salomaa: Mathematician, Computer Scientist, and Teacher;2019

2. State Complexity of Pseudocatenation;Language and Automata Theory and Applications;2019

3. State complexity of permutation on finite languages over a binary alphabet;Theoretical Computer Science;2017-06

4. Ambiguity, Nondeterminism and State Complexity of Finite Automata;Acta Cybernetica;2017

5. Foreword;International Journal of Computer Mathematics;2013-06