نتایج جستجو برای: symbolic
تعداد نتایج: 31160 فیلتر نتایج به سال:
Journal:
:Applicable Algebra in Engineering, Communication and Computing
1993
Journal:
:Logical Methods in Computer Science
2023
We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications software verification. The state-of-the-art literature on this topic follows query learning paradigm, and so far all obtained results are positive. provide necessary condition for efficient SFAs from which we obtain first negative result. main focus our work lies under paradigm identific...
Journal:
:Proceedings of the Japan Academy, Series A, Mathematical Sciences
1954
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید