Abstract
In this paper, we discuss fuzzy pushdown automata based on complete residuated lattices \(\mathcal {L}\) with a fuzzy initial state, called \(\mathcal {L}\)-valued pushdown automata. A concise proof of the equivalence between \(\mathcal {L}\)-PDAs accepting fuzzy languages by final state (\(\mathcal {L}\)-PDA\(_{F}\)s) and by empty stack (\(\mathcal {L}\)-PDA\(_{\emptyset }\)s) is given. The several types of \(\mathcal {L}\)-PDA\(_{F}\)s and \(\mathcal {L}\)-PDA\(_{\emptyset }\)s with respect to initial and final states being crisp or not are classified. It’s shown that those variants have same computing power. Next, we introduce the notion of fuzzy pushdown automata without \(\varepsilon \)-moves (\(\mathcal {L}\)-PDA\(^{-\varepsilon }\)s). We show that \(\mathcal {L}\)-PDAs and \(\mathcal {L}\)-PDA\(^{-\varepsilon }_{\emptyset }\)s are equivalent as the acceptors of fuzzy languages except the empty string \(\varepsilon \). Finally, we study the relationships of \(\mathcal {L}\)-PDA\(^{-\varepsilon }_{F}\)s and \(\mathcal {L}\)-PDA\(^{-\varepsilon }_{\emptyset }\)s.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Enquiries about data availability should be directed to the authors
References
Asveld PRJ (2005) Fuzzy context-free languages-Part 1: generalized fuzzy context-free grammars. Theor Comput Sci 347(1):167–190. https://doi.org/10.1016/j.tcs.2005.06.012
Asveld PRJ (2005) Fuzzy context-free languages-Part 2: recognition and parsing algorithms. Theor Comput Sci 347(1):191–213. https://doi.org/10.1016/j.tcs.2005.06.013
Ballester-Bolinches A, Cosme-Llópez E, Rutten J (2015) The dual equivalence of equations and coequations for automata. Inf Comput 244:49–75. https://doi.org/10.1016/j.ic.2015.08.001
Bucurescu I, Pascu A (1981) Fuzzy pushdown automata. Int J Comput Math 10(2):109–119. https://doi.org/10.1080/00207168108803274
Bělohlávek R (2002) Fuzzy relational systems: foundations and Principles. Kluwer. https://doi.org/10.1007/978-1-4615-0633-1
Cao YZ, Ezawa Y (2012) Nondeterministic fuzzy automata. Inf Sci 191:86–97. https://doi.org/10.1016/j.ins.2011.12.024
Ćirić M, Ignjatović J, Damljanović N (2012) Bisimulations for fuzzy automata. Fuzzy Sets Syst 186:100–139. https://doi.org/10.1016/j.fss.2011.07.003
Ćirić M, Ignjatović J, Jančić I, Damljanović N (2012) Computation of the greatest simulations and bisimulations between fuzzy automata. Fuzzy Sets Syst 208:22–42. https://doi.org/10.1016/j.fss.2012.05.006
Droste M, Dziadek S, Kuich W (2019) Weighted simple reset pushdown automata. Theor Comput Sci 777:252–259. https://doi.org/10.1016/j.tcs.2019.01.016
Esparza J, Kučera A, Mayr R (2006) Model checking probabilistic pushdown automata. Log Methods Comput Sci. https://doi.org/10.2168/LMCS-2(1:2)2006
Finkel A, Willems B, Wolper P (1997) A direct symbolic approach to model checking pushdown systems (extended abstract). Electron Notes Theor Comput Sci 9:27–37. https://doi.org/10.1016/S1571-0661(05)80426-8
Guo XH (2012) A comment on “automata theory based on complete residuated lattice-valued logic: pushdown automata’’. Fuzzy Sets Syst 199:130–135. https://doi.org/10.1016/j.fss.2011.10.003
Hájek P (1998) Metamathematics of fuzzy logic. Kluwer Academic Publishers, Boston
Han ZW, Li YM (2010) Pushdown automata and context-free grammars based on quantum logic. J Softw 21(9):2107–2117. https://doi.org/10.3724/SP.J.1001.2010.03855
Hopcroft JE, Ullman JD (1968) Decidable and undecidable questions about automata. J Acm 15(2):317–324. https://doi.org/10.1145/321450.321463
Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley Publishing, Boston
Jin JH, Li CQ (2016) The algebraic characterizations for a formal power series over complete strong bimonoids. SpringerPlus 5(1):1415–1426. https://doi.org/10.1186/s40064-016-1764-x
Li P, Li YM (2006) Algebraic properties of LA-languages. Inf Sci 176(21):3232–3255. https://doi.org/10.1016/j.ins.2005.10.003
Li YM (2011) Finite automata theory with membership values in lattices. Inf Sci 181(5):1003–1017. https://doi.org/10.1016/j.ins.2010.11.006
Li YM, Li P (2016) Fuzzy computing theory. Science Press, Beijing, China
Li YM, Pedrycz W (2005) Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets Syst 156(1):68–92. https://doi.org/10.1016/j.fss.2005.04.004
Li ZH, Li P, Li YM (2006) The relationships among several types of fuzzy automata. Inf Sci 176(15):2208–2226. https://doi.org/10.1016/j.ins.2005.05.001
Michaliszyn J, Otop J (2020) Non-deterministic weighted automata evaluated over markov chains. J Comput Syst Sci 108:118–136. https://doi.org/10.1016/j.jcss.2019.10.001
Micić I, Jančić Z, Ignjatović J, Ćirić M (2014) Determinization of fuzzy automata by means of the degrees of language inclusion. IEEE Trans Fuzzy Syst 23(6):2144–2153. https://doi.org/10.1109/TFUZZ.2015.2404348
Pan HY, Cao YZ, Zhang M, Chen YX (2014) Simulation for lattice-valued doubly labeled transition systems. Int J Approx Reason 55(3):797–811. https://doi.org/10.1016/j.ijar.2013.11.009
Pan HY, Li YM, Cao YZ (2015) Lattice-valued simulations for quantitative transition systems. Int J Approx Reason 56:28–42. https://doi.org/10.1016/j.ijar.2014.10.001
Pan HY, Li YM, Cao YZ, Li P (2017) Nondeterministic fuzzy automata with membership values in complete residuated lattices. Int J Approx Reason 82:22–38. https://doi.org/10.1016/j.ijar.2016.11.020
Pan HY, Song F, Cao YZ, Qian JY (2019) Fuzzy pushdown termination games. IEEE Trans Fuzzy Syst 27(15):760–774. https://doi.org/10.1109/TFUZZ.2018.2869127
Qiu DW (2001) Automata theory based on complete residuated lattice-valued logic (I). Sci China (Ser F Inf Sci) 44(6):419–429. https://doi.org/10.1007/bf02713945
Qiu DW (2002) Automata theory based on complete residuated lattice-valued logic (II). Sci China (Ser F Inf Sci) 45(06):442–452
Qiu DW (2006) Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note. Fuzzy Sets Syst 157(15):2128–2138. https://doi.org/10.1016/j.fss.2006.03.014
Qiu DW (2007) Automata theory based on quantum logic: reversibilities and pushdown automata. Theor Comput Sci 386(1):38–56. https://doi.org/10.1016/j.tcs.2007.05.026
Santos ES (1968) Maximin automata. Inf Control 13(4):363–377. https://doi.org/10.1016/S0019-9958(68)90864-4
Santos ES (1976) Fuzzy automata and languages. Inf Sci 10(3):193–197. https://doi.org/10.1016/0020-0255(76)90040-2
Schützenberger M (1963) On context-free languages and push-down automata. Inf Control 6(3):246–264. https://doi.org/10.1016/S0019-9958(63)90306-1
Song F, Touili T (2014) Efficient CTL model-checking for pushdown systems. Theor Comput Sci 549:127–145. https://doi.org/10.1016/j.tcs.2014.07.001
Su L (1992) A machine accepted fuzzy context-free languages-fuzzy pushdown automata. BUSEFAL 49:62–72
Walukiewicz I (2001) Pushdown processes: games and model-checking. Inf Comput 164(2):234–263. https://doi.org/10.1006/inco.2000.2894
Wang HH, Zhao LY, Li P (2019) An improved proof of the closure under homomorphic inverse of FCFL valued in lattice-ordered monoids. In: Sun X, He K, Chen X (eds.), Theoretical computer science. Singapore pp 64–75
Wee WG, Fu KS (1969) A formulation of fuzzy automata and its application as a model of learning systems. IEEE Trans Syst Sci Cybern 5(3):215–223. https://doi.org/10.1109/tssc.1969.300263
Wu LH, Qiu DW (2010) Automata theory based on complete residuated lattice-valued logic: reduction and minimization. Fuzzy Sets Syst 161(12):1635–1656. https://doi.org/10.1016/j.fss.2009.12.011
Xing HY (2007) Fuzzy pushdown automata. Fuzzy Sets Syst 158(13):1437–1449. https://doi.org/10.1016/j.fss.2007.01.012
Xing HY, Qiu DW (2009) Automata theory based on complete residuated lattice-valued logic: a categorical approach. Fuzzy Sets Syst 160(16):2416–2428. https://doi.org/10.1016/j.fss.2009.01.007
Xing HY, Qiu DW (2009) Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 160(8):1141–1151. https://doi.org/10.1016/j.fss.2008.06.016
Xing HY, Qiu DW, Liu F, Fan Z (2007) Equivalence in automata theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 158(13):1407–1422. https://doi.org/10.1016/j.fss.2007.01.008
Xing HY, Qiu DW, Liu FC (2009) Automata theory based on complete residuated lattice-valued logic: pushdown automata. Fuzzy Sets Syst 160(8):1125–1140. https://doi.org/10.1016/j.fss.2008.07.010
Ying MS (2000) Automata theory based on quantum logic (I). Int J Theor Phys 39(11):981–991. https://doi.org/10.1023/A:1003642222321
Ying MS (2000) Automata theory based on quantum logic (II). Int J Theor Phys 39(11):2545–2557. https://doi.org/10.1023/A:1026453524064
Zhao L, Wang XB, Duan ZH (2019) Model checking of pushdown systems for projection temporal logic. Theor Comput Sci 774:82–94. https://doi.org/10.1016/j.tcs.2016.06.031
Funding
This work is supported by the National Natural Science Foundation of China (Grant No. 61673250), the Fundamental Research Funds for the Central Universities (GK201803008), and the 2020 China-CEEC Joint Education Project for Higher Education (Grant No. 202008).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wang, H., Zhao, L., He, Y. et al. Fuzzy pushdown automata based on complete residuated lattices: variants and computing powers. Soft Comput 27, 6927–6938 (2023). https://doi.org/10.1007/s00500-023-08062-7
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-023-08062-7