Abstract
Multi-matching nested relation consists of a sequence of linearly ordered positions, call, internal, and return, augmented with one-to-one, one-to-n or n-to-one matching nested edges from call to return. After word encoding by introducing tagged letters, Multi-matching Nested Words (MNW) are obtained over a tagged alphabet. Then Multi-matching Nested Expressions (MNE) and Multi-matching Nested Traceable Automata (MNTA) are defined over MNWs. Further, a transformation method from MNTA to MNE is proposed. An extra state is introduced as the unique initial state. Three kinds of labelled arcs are created for different kinds of transitions. They are merged according to specific strategies and meanwhile the expressions are calculated. As a result, the corresponding MNE can be obtained.
This research is supported by the NSFC Grant Nos. 61732013 and 61751207, the National Key Research and Development Program of China (No. 2018AAA0103202), and Shaanxi Key Science and Technology Innovation Team Project (No. 2019TD-001).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Pearson Education, Boston (2000). ISBN 0-201-44124-1
Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1–13. Springer, Heidelberg (2006). https://doi.org/10.1007/11779148_1
Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1–43 (2009)
Neven, F.: Automata, logic, and XML. In: Bradfield, J. (ed.) CSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45793-3_2
Hunter, D., Rafter, J., Fawcett, J.: Beginning XML. John Wiley & Sons, New York (2007)
Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: Proceedings of the 16th International Conference on World Wide Web, pp. 1053–1062 (2007)
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 202–211 (2004)
Kegang, H., Zhenhua, D., Xin, L.: On traceable automata. Chin. J. Comput. 5, 340–348 (1990)
Kegang, H., Zhenhua, D.: The relationship between DTA and DMTA. Microelectron. Comput. 4, 6–10 (1990)
Kegang, H., Zhenhua, D.: Two fundamental theorems on traceable automata. J. Northwest Univ. Nat. Sci. Ed. 20(1), 11–17 (1990)
Kernighan, B.W., Ritchie, D.M.: The C Programming Language. Prentice Hall, New Jersey (2006)
Lin, X.J., Wu, C.K., Liu, F.: Many-to-one encryption and authentication scheme and its application. J. Commun. Netw. 10(1), 18–27 (2008)
Zhong, H., Cui, J., Shi, R., Xia, C.: Many-to-one homomorphic encryption scheme. Secur. Commun. Netw. 9(10), 1007–1015 (2016)
Silberschatz, A., Korth, H.F., Sudarshan, S.: Database System Concepts. McGraw-Hill, New York (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, J., Duan, Z., Tian, C. (2020). Transforming Multi-matching Nested Traceable Automata to Multi-matching Nested Expressions. In: Wu, W., Zhang, Z. (eds) Combinatorial Optimization and Applications. COCOA 2020. Lecture Notes in Computer Science(), vol 12577. Springer, Cham. https://doi.org/10.1007/978-3-030-64843-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-64843-5_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-64842-8
Online ISBN: 978-3-030-64843-5
eBook Packages: Computer ScienceComputer Science (R0)