Citation: | LIU Jin, DUAN Zhenhua, TIAN Cong, “Multi-Matching Nested Languages,” Chinese Journal of Electronics, vol. 31, no. 1, pp. 137-145, 2022, doi: 10.1049/cje.2020.00.228 |
[1] |
D. Hunter, J. Rafter, and J. Fawcett, Beginning XML, New York: John Wiley & Sons, pp.18–31, 2007.
|
[2] |
V. Kumar, P. Madhusudan, and M. Viswanathan, “Visibly pushdown automata for streaming XML,” in Proc. of the 16th International Conference on World Wide Web, Banff, Alberta, pp.1053–1062, 2007.
|
[3] |
R. Alur and P. Madhusudan, “Adding nesting structure to words,” Journal of the ACM, vol.56, no.3, pp.1–43, 2009.
|
[4] |
R. Alur and P. Madhusudan, “Visibly pushdown languages,” in Proc. of the Thirty-sixth Annual ACM Symposium on Theory of Computing, Chicago, Illinois, pp.202–211, 2004.
|
[5] |
K. G. Hao, Z. H. Duan, and X. Li, “On traceable automata,” Chinese Journal of Computers, vol.5, pp.340–348, 1990. (in Chinese)
|
[6] |
K. G. Hao and Z. H. Duan, “The relationship between DTA and DMTA,” Microelectronics & Computer, vol.4, pp.6–10, 1990. (in Chinese)
|
[7] |
K. G. Hao and Z. H. Duan, “Two fundamental theorems on traceable automata,” Journal of Northwest University (Natural Science Edition), vol.20, no.1, pp.11–17, 1990. (in Chinese)
|
[8] |
R. McNaughton, “Parenthesis grammars,” Journal of the ACM, vol.14, no.3, pp.490–500, 1967. doi: 10.1145/321406.321411
|
[9] |
D. E. Knuth, “A characterization of parenthesis languages,” Information and Control, vol.11, no.3, pp.269–289, 1967. doi: 10.1016/S0019-9958(67)90564-5
|
[10] |
S. Ginsburg and M. A. Harrison, “Bracketed context-free languages,” Journal of Computer and System Sciences, vol.1, no.1, pp.1–23, 1967. doi: 10.1016/S0022-0000(67)80003-5
|
[11] |
E. S. Santos, “A note on bracketed grammars,” Journal of the ACM, vol.19, no.2, pp.222–224, 1972. doi: 10.1145/321694.321696
|
[12] |
J. Berstel and L. Boasson, Formal and Natural Computing, Berlin: Springer, pp.3–25, 2002.
|
[13] |
A. Brüggemann-Klein and D. Wood, “Balanced contextfree grammars, hedge grammars and pushdown caterpillar automata,” in Proc. of Extreme Markup Languages®, Montréal, Quebec, pp.1–16, 2004.
|
[14] |
A. Brüggemann-Klein, M. Murata, and D. Wood, “Regular tree and regular hedge languages over unranked alphabets,” HKUST Theoretical Computer Science Center Research Report, HKUST-TCSC-2001-05, 2001.
|
[15] |
J. Berstel and L. Boasson, “XML grammars”, in Proc. of International Symposium on Mathematical Foundations of Computer Science, Bratislava, pp.182–191, 2000.
|
[16] |
J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, New York: Pearson Education, pp.171–314, 2000.
|
[17] |
K. R. Fall and W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Hoboken: Addison-Wesley Professional, pp.595–605, 2011.
|
[18] |
M. Bogdanoski, T. Suminoski, and A. Risteski, “Analysis of the SYN flood DoS attack,” International Journal of Computer Network and Information Security, vol.5, no.8, pp.1–11, 2013.
|
[19] |
V. Zlomislić, K. Fertalj, and V. Sruk, “Denial of service attacks: An overview,” in Proc. of 2014 9th Iberian Conference on Information Systems and Technologies, Barcelona, pp.1–6, 2014.
|