Author:
Holzer Markus,Jakobi Sebastian
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Babu, S.A., Pandya, P.K.: Chop expressions and discrete duration calculus. In: D’Souza, D., Shankar, P. (eds.) Modern Applications of Automata Theory. IISc research Monographs Series, vol. 2. World Scientific, Singapore (2010)
2. Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)
3. Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. Comput. C-12(2), 67–76 (1963)
4. Cărăuşu, A., Păun, G.: String intersection and short concatenation. Rev. Roumaine Math. Pures Appl. 26, 713–726 (1981)
5. Cohen, R.S.: Star height of certain families of regular events. J. Comput. System Sci. 4(3), 281–297 (1970)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Conjugate word blending: formal model and experimental implementation by XPCR;Natural Computing;2021-08-31
2. State Complexity of Overlap Assembly;International Journal of Foundations of Computer Science;2020-12
3. Word Blending in Formal Languages*;Fundamenta Informaticae;2019-10-23
4. State Complexity of Simple Splicing;Descriptional Complexity of Formal Systems;2019
5. Word Blending in Formal Languages: The Brangelina Effect;Unconventional Computation and Natural Computation;2018