Union-Freeness, Deterministic Union-Freeness and Union-Complexity-Reference-Cited by-同舟云学术

Union-Freeness, Deterministic Union-Freeness and Union-Complexity

Published:2019 Issue: Volume: Page:46-56
ISSN:0302-9743
Container-title:Descriptional Complexity of Formal Systems
language:
Short-container-title:

Author:

Nagy Benedek

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-23247-4_3

Reference13 articles.

1. Lecture Notes in Computer Science;S Afonin,2009

2. Brzozowski, J.A.: Regular expression techniques for sequential circuits. Ph.D. Dissertation, Department of Electrical Engineering, Princeton University, Princeton, June 1962

3. Lecture Notes in Computer Science;JA Brzozowski,2018

4. Crvenković, S., Dolinka, I., Ésik, Z.: On equations for union-free regular languages. Inf. Comput. 164(1), 152–172 (2001). https://doi.org/10.1006/inco.2000.2889

5. Holzer, M., Kutrib, M.: Structure and complexity of some subregular language families. In: Konstantinidis, S., Moreira, N., Reis, R., Shallit, J. (eds.) The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski, pp. 59–82. World Scientific (2017). https://doi.org/10.1142/9789813148208_0003

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

1. Various Types of Comet Languages and their Application in External Contextual Grammars;Electronic Proceedings in Theoretical Computer Science;2024-09-11

2. Closure Properties of Subregular Languages Under Operations;International Journal of Foundations of Computer Science;2023-05-04

3. Union-Complexities of Kleene Plus Operation;Descriptional Complexity of Formal Systems;2022

4. Closure Properties of Subregular Languages Under Operations;Lecture Notes in Computer Science;2022

5. Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages;International Journal of Foundations of Computer Science;2021-04-23