The Tractability Frontier for NFA Minimization-Reference-Cited by-同舟云学术

The Tractability Frontier for NFA Minimization

Published: Issue: Volume: Page:27-38
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Björklund Henrik,Martens Wim

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70583-3_3.pdf

Reference18 articles.

1. Abdulla, P., Deneux, J., Kaati, L., Nilsson, M.: Minimization of non-deterministic automata with large alphabets. In: CIAA, pp. 31–42 (2006)

2. Goldstine, J., Kappes, M., Kintala, C., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Univ. Comp. Science 8(2), 193–234 (2002)

3. Gramlich, G., Schnitger, G.: Minimizing NFAs and regular expressions. JCSS 73(6), 908–923 (2007)

4. Lecture Notes in Computer Science;H. Gruber,2006

5. Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: LATA, pp. 261–272 (2007)

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

1. Generating, Sampling and Counting Subclasses of Regular Tree Languages;Theory of Computing Systems;2012-10-26

2. The tractability frontier for NFA minimization;Journal of Computer and System Sciences;2012-01

3. Descriptional and computational complexity of finite automata—A survey;Information and Computation;2011-03

4. Unambiguous Finite Automata over a Unary Alphabet;Mathematical Foundations of Computer Science 2010;2010

5. Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata;Lecture Notes in Computer Science;2010