Unary Self-verifying Symmetric Difference Automata-Reference-Cited by-同舟云学术

Unary Self-verifying Symmetric Difference Automata

Published:2016 Issue: Volume: Page:180-191
ISSN:0302-9743
Container-title:Descriptional Complexity of Formal Systems
language:
Short-container-title:

Author:

Marais Laurette,van Zijl Lynette

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-41114-9_14

Reference10 articles.

1. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)

2. Van Zijl, L.: Generalized nondeterminism and the succinct representation of regular languages. Ph.D. thesis, University of Stellenbosch (1997). http://www.cs.sun.ac.za/~lvzijl/publications/boek.ps.gz

3. Lecture Notes in Computer Science;B Van der Merwe,2012

4. Assent, I., Seibert, S.: An upper bound for transforming self-verifying automata into deterministic ones. RAIRO-Theoretical Informatics and Applications-Informatique Théorique et Applications 41(3), 261–265 (2007)

5. Lecture Notes in Computer Science;J Hromkovič,1999

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

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

2. The state complexity of language operations on XNFA-succinct unary regular languages;Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists;2018-09-26

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