Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

سال انتشار: 1395
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 141

فایل این مقاله در 24 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_IJFS-13-2_006

تاریخ نمایه سازی: 28 خرداد 1401

چکیده مقاله:

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is taken over to  prove a  main theorem:   the  class  of   languages generated by an {L}valued alternating regular tree grammar {LAG}) is  equal  to  the  class  of  languages  accepted  by an {L}valued alternating top-down tree automaton {LAA}). The second  way is taken over to define   a new type of   automaton by combining the {L}valued  alternating top-down tree automaton with stack,   called {L}-valued   alternating stack tree automaton {LASA}  and  the generative power of it is compared to some well-known language classes, especially to  {LAA} and to {LAG}Also, we have derived a characterization of the state alternating regular tree grammar {LSAG}) in terms of  {LASA}.

کلیدواژه ها:

Lattice-valued logic ، Alternating top-down tree automaton ، State alternating regular tree grammar ، Alternating stack tree automaton

نویسندگان

Maryam Ghorani

Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran

Mohammad Mehdi Zahedi

Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • A. Bouhoula, J. P. Jouannaud and J. Meseguer, Speci cation and ...
  • G. Birkho , Lattice theory, American Mathematical Society Colloquium Publications, NewYork, ...
  • S. Bozapalidis and O. L. Bozapalidoy, Fuzzy tree language recognizability, ...
  • J. R. Buchi, Weak second-order arithmetic and nite automata, Zeitschrift ...
  • Y. Cao, L. Xia and M. Ying, Probabilistic automata for ...
  • A. K. Chandra, D. C. Kozen and L. J. Stockmeyer, ...
  • S. R. Chaudhari and M. N. Joshi, A note on ...
  • H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, ...
  • Z. Esik and G. Liu, Fuzzy tree automata, Fuzzy Sets ...
  • B. Finkbeiner and H. Sipma, Checking nite traces using alternating ...
  • F. Gecseg and M. Steinby, Tree automata, Akademiai Kiado, Budapest, ...
  • M. Ghorani and M. M. Zahedi, Characterization of complete residuated ...
  • M. Ghorani, M. M. Zahedi and R. Ameri, Algebraic properties ...
  • J. E. Hopcroft, R. Motwani and J. D. Ullman, Introduction ...
  • H. Hosoya, J. Vouillon and B. C. Pierce, Regular expression ...
  • J. Ignjatovic, M. Ciric and S. Bogdanovic, Determinization of fuzzy ...
  • J. Jin, Q. Li and Y. Li, Algebraic properties of ...
  • D. Kirsten, Alternating tree automata and parity games, In: E. ...
  • R. E. Ladner, R. J. Lipton and L. J. Stockmeyer, ...
  • R. E. Ladner, R. J. Lipton and L. J. Stockmeyer, ...
  • E. T. Lee and L. A. Zadeh, Note on fuzzy ...
  • H. X. Lei and Y. Li, Minimization of states in ...
  • Y. M. Li and W. Pedrycz, Minimization of lattice nite ...
  • L. Li and D. Qiu, On the state minimization of ...
  • Y. Li and Q. Wang, The universal fuzzy automata, Fuzzy ...
  • J. N. Mordeson and D. S. Malik, Fuzzy automata and ...
  • E. Moriya, A grammatical characterization of alternating pushdown automata, TheoreticalComputer ...
  • E. Moriya, D. Hofbauer, M. Huber and F. Otto, On ...
  • E. Moriya and F. Otto, Two ways of introducing alternation ...
  • Otto and H. Fernau (Eds.), Language and Automata Theory and ...
  • C. W. Omlin, K. K. Thornber and C. L. Giles, ...
  • W. Pedrycz and A. Gacek, Learning of fuzzy automata, International ...
  • D. W. Qiu, Automata theory based on completed residuated lattice-valued ...
  • D. W. Qiu, Automata theory based on completed residuated lattice-valued ...
  • D. W. Qiu, Characterizations of fuzzy nite automata, Fuzzy Sets ...
  • D. W. Qiu, Pumping lemma in automata theory based on ...
  • E. S. Santos, Maximin automata, Inform. and Control, ۱۲ (۱۹۶۸), ...
  • G. Slutzki, Alternating tree automata, In: G. Goos and J. ...
  • G. Slutzki, Alternating tree automata, Theorical Computer Science, ۴۱ (۱۹۸۵), ...
  • J. Tang, Y. Fang and J. G. Tang, The lattice-valued ...
  • M. G. Thomason and P. N. Marinos, Deterministic acceptors of ...
  • M. Y. Vardi, Alternating automata and program veri cation, In: J. ...
  • M. Y. Vardi, An automata-theoretic approach to linear temporal logic, ...
  • M. Y. Vardi, Alternating automata: checking truth and validity for ...
  • K. N. Verma and J. Goubault-Larrecq, Alternating two-way AC-tree automata, ...
  • W. G. Wee and K. S. Fu, A formulation of ...
  • T. Wilke, Alternating tree automata, parity games, and modal -calculus, ...
  • L. Wu and D. W. Qiu, Automata theory based on ...
  • H. Y. Xing and D. W. Qiu, Pumping lemma in ...
  • H. Y. Xing, D. W. Qiu and F. C. Liu, ...
  • H. Y. Xing, D. W. Qiu, F. C. Liu and ...
  • نمایش کامل مراجع