A Multivariate Analysis of Some DFA Problems-Reference-Cited by-同舟云学术

A Multivariate Analysis of Some DFA Problems

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

Author:

Fernau Henning,Heggernes Pinar,Villanger Yngve

Publisher

Springer Berlin Heidelberg

Link

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

Reference34 articles.

1. Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms 2(2), 153–177 (2006)

2. Angluin, D.: On the complexity of minimum inference of regular sets. Information and Control (now Information and Computation) 39, 337–350 (1978)

3. Arvind, V., Köbler, J., Lindner, W.: Parameterized learnability of juntas. Theoretical Computer Science 410(47-49), 4928–4936 (2009)

4. Lecture Notes in Computer Science;M.V. Berlinkov,2010

5. Björklund, H., Martens, W.: The tractability frontier for NFA minimization. Journal of Computer and System Sciences 78(1), 198–210 (2012)

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

1. Complexity of road coloring with prescribed reset words;Journal of Computer and System Sciences;2019-09

2. A multi-parameter analysis of hard problems on deterministic finite automata;Journal of Computer and System Sciences;2015-06

3. Faster decision of first-order graph properties;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14