On the transformation and automata representation of ε-fuzzy automata grammars
Abstract
This paper is devoted to the analysis of ε-fuzzy-automatic grammars. We prove a theorem on the removal of rules of the form B→ε (n) from such grammars, providing an algorithm, and we also prove a theorem on the removal of axioms from the right-hand sides of such grammars, similarly providing an algorithm. In addition, the article considers grammars containing the rule S→ε (n) and a method for their automaton representation. F-NDFAs (fuzzy deterministic finite automata with a phantom state) and NDFAs with predetermination (with a predetermined degree of membership of the initial state) are introduced. The relationship between grammars and these automata is formulated as theorems, and transformation algorithms are provided.
Full Text:
PDF (Russian)References
Klir G., Yuan B.: Fuzzy Sets and Fuzzy Logic. Theory and Applications. (1995), Prentice Hall
Moraga, C.: An approach to fuzzy context free languages. ESTYLF08, Cuencas Minera(Mieres - Langreo), pp. 17–19 (2008)
Moraga C. Some Properties of Fuzzy Languages// Computational Intelligence. Theory and Applications. International Conference 9th Fuzzy Days At: Dortmund, Germany 2006. – P.367-374
Zadeh L.A.: Fuzzy Sets. Information and Control 8 (3), (1965), 338-353
Kozlov, S. V., and A. V. Svetlakov About LL(1)-grammars, algorithms on them and methods of their analysis in programming /International Journal of Open Information Technologies, vol. 10, no. 3 (2022), pp. 30–38.
Formal Languages and Compilers: A Textbook for Universities / A. A. Malyavko. – Moscow: Yurait Publishing House, 2020. – 429 pp.
Svetlakov, A. V. On different ways of representing some fuzzy-automata languages / A. V. Svetlakov, G. A. Bananaru // Systems of Computer Mathematics and Their Applications. – 2025. – No. 26. – Pp. 270–278.
Refbacks
- There are currently no refbacks.
Abava Кибербезопасность Monetec 2026 СНЭ
ISSN: 2307-8162