Minimal DFA for Symmetric Difference NFA-Reference-Cited by-同舟云学术

Minimal DFA for Symmetric Difference NFA

Published:2012 Issue: Volume: Page:307-318
ISSN:0302-9743
Container-title:Descriptional Complexity of Formal Systems
language:
Short-container-title:

Author:

van der Merwe Brink,Tamm Hellis,van Zijl Lynette

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31623-4_24

Reference17 articles.

1. Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on the Mathematical Theory of Automata. MRI Symposia Series, pp. 529–561. Polytechnic Press of Polytechnic Institute of Brooklyn (1963)

2. Lecture Notes in Computer Science;J. Brzozowski,2011

3. Brzozowski, J., Tamm, H.: Quotient complexities of atoms of regular languages. In: Proceedings of the 16th International Conference on Developments in Language Theory (DLT). Springer (August 2012)

4. Lecture Notes in Computer Science;F. Denis,2001

5. Dornhoff, L., Hohn, F.: Applied Modern Algebra. Macmillan Publishing Company (1978)

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

1. Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata;International Journal of Foundations of Computer Science;2022-04

2. State complexity of GF(2)-operations on unary languages;Information and Computation;2021-01

3. Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata;Electronic Proceedings in Theoretical Computer Science;2017-08-21

4. State Complexity of Unary SV-XNFA with Different Acceptance Conditions;Descriptional Complexity of Formal Systems;2017

5. Unary Self-verifying Symmetric Difference Automata;Descriptional Complexity of Formal Systems;2016