Minimal Union-Free Decompositions of Regular Languages-Reference-Cited by-同舟云学术

Minimal Union-Free Decompositions of Regular Languages

Published:2009 Issue: Volume: Page:83-92
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Afonin Sergey,Golomazov Denis

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00982-2_7

Reference11 articles.

1. Paz, A., Peleg, B.: On concatenative decompositions of regular events. IEEE Transactions on Computers 17(3), 229–237 (1968)

2. Brzozowski, J., Cohen, R.: On decompositions of regular events. Journal of the ACM 16(1), 132–144 (1969)

3. Nagy, B.: A normal form for regular expressions. In: Eighth International Conference on Developments in Language Theory, CDMTCS Technical Report 252, CDMTCS, Auckland, pp. 51–60 (2004)

4. Brzozowski, J.: Regular expression techniques for sequential circuits. PhD thesis, Princeton University, Princeton, New Jersey (1962)

5. Ehrenfeucht, A., Zeiger, P.: Complexity measures for regular expressions. In: STOC 1974: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 75–79. ACM, New York (1974)

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

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

2. An adaptive parallel algorithm for finite language decomposition;Applied Intelligence;2021-06-26

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

4. Operational union-complexity;Information and Computation;2021-01

5. Union-Freeness, Deterministic Union-Freeness and Union-Complexity;Descriptional Complexity of Formal Systems;2019