The Range of State Complexities of Languages Resulting from the Cascade Product—The Unary Case (Extended Abstract)-Reference-Cited by-同舟云学术

The Range of State Complexities of Languages Resulting from the Cascade Product—The Unary Case (Extended Abstract)

Published:2021 Issue: Volume: Page:90-101
ISSN:0302-9743
Container-title:Implementation and Application of Automata
language:
Short-container-title:

Author:

Holzer Markus,Rauch Christian

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-79121-6_8

Reference12 articles.

1. Lecture Notes in Computer Science;K Čevorová,2013

2. Lecture Notes in Computer Science;K Čevorová,2014

3. Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inf. Comput. 205(11), 1652–1670 (2007)

4. Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley (1978)

5. Holzer, M., Rauch, C.: The range of state complexities of languages resulting from the cascade product-the general case (2021). Proc. DLT, to appear

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

1. State complexity of binary coded regular languages;Theoretical Computer Science;2024-04

2. On the accepting state complexity of operations on permutation automata;RAIRO - Theoretical Informatics and Applications;2023

3. On the Accepting State Complexity of Operations on Permutation Automata;Electronic Proceedings in Theoretical Computer Science;2022-08-27

4. On the Descriptional Complexity of the Direct Product of Finite Automata;Descriptional Complexity of Formal Systems;2022

5. State Complexity of Binary Coded Regular Languages;Descriptional Complexity of Formal Systems;2022