Jelena Matejić
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jelena Matejić has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ivana Micić
University of Niš, Faculty of Sciences and Mathematics, Niš, Serbia
4 shared publications - Miroslav Ćirić
Faculty of Sciences and Mathematics, University of Niš, Višegradska 33, 18108 Niš, Serbia
4 shared publications - Jelena Ignjatović
Department of Computer Science, Faculty of Sciences and Mathematics, University of Niš, Niš, Serbia
2 shared publications - Stefan Stanimirović
Univ Nis, Fac Sci & Math, Visegradska 33, Nish 18000, Serbia
2 shared publications - Aleksandar Milenković
University of Kragujevac, Republic of Serbia
1 shared publication - Aleksandar Stamenković
University of Niš, Faculty of Sciences and Mathematics, Niš, Serbia
1 shared publication
Latest Publications
- Open Access
Truncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number λ, we transform the complete max-plus semiring into a commutative, complete, additively idempotent semiring , called the lower λ-truncation of . It is obtained by removing from all real numbers smaller than λ, inheriting the addition operation, shifting the original products by −λ, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over , to , where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over can be transformed into presimulations and prebisimulations between the original automata over . Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring .Open AccessTruncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number λ, we transform the complete max-plus semiring into a commutative, complete, additively idempotent semiring , called the lower λ-truncation of . It is obtained by removing from all real numbers smaller than λ, inheriting the addition operation, shifting the original products by −λ, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over , to , where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over can be transformed into presimulations and prebisimulations between the original automata over . Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring . - Open Access
- 22 December 2025
- Published by MDPI AG in Preprints.org
Truncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number $\lambdaup$, we transform the complete max-plus semiring $\mathbb{R}_\infty$ into a commutative, complete, additively idempotent semiring $\mathbb{R}_\infty^\lambdaup$, called the lower $\lambdaup$-truncation~of~$\mathbb{R}_\infty$. It is obtained by removing from $\mathbb{R}_\infty$ all real numbers smaller than $\lambdaup$, inheriting the addition operation, shifting the original products by $-\lambdaup$, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over $\mathbb{R}_\infty$, to $\mathbb{R}_\infty^\lambdaup$, where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over $\mathbb{R}_\infty^\lambdaup$ can be transformed into presimulations and prebisimulations between the original automata over $\mathbb{R}_\infty$. Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring $\mathbb{R}_\infty$.- 22 December 2025
- Published by MDPI AG in Preprints.org
Open AccessTruncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number $\lambdaup$, we transform the complete max-plus semiring $\mathbb{R}_\infty$ into a commutative, complete, additively idempotent semiring $\mathbb{R}_\infty^\lambdaup$, called the lower $\lambdaup$-truncation~of~$\mathbb{R}_\infty$. It is obtained by removing from $\mathbb{R}_\infty$ all real numbers smaller than $\lambdaup$, inheriting the addition operation, shifting the original products by $-\lambdaup$, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over $\mathbb{R}_\infty$, to $\mathbb{R}_\infty^\lambdaup$, where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over $\mathbb{R}_\infty^\lambdaup$ can be transformed into presimulations and prebisimulations between the original automata over $\mathbb{R}_\infty$. Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring $\mathbb{R}_\infty$. - Open Access
- 29 April 2025
- Published by FSFEI HE Don State Technical University in International Journal of Cognitive Research in Science, Engineering and Education (IJCRSEE)
- Vol. 13 (1)
Impact of Peer Feedback in a Web Programming Course on Students’ Achievement
In addition to learning technical aspects of website creation, students must connect different knowledge, think critically, seek more information, and approach their work from various perspectives. These requirements, or specified competencies, can be developed through providing and receiving peer feedback, which is confirmed as an efficient learning strategy in various empirical studies on different subjects. The aim of this research is to investigate the impact of peer feedback on students’ achievements in the Web Programming Course. We conducted a quantitative study with two groups of students. Students from the experimental group participated in online giving and receiving peer feedback regarding students’ assignments, while students from the control group did not have this opportunity. For evaluating students’ work, we used rubrics. The results indicate that students, through analyzing their peers’ work, providing qualitative assessments, reflecting on their work in line with received comments, and making necessary corrections, create content that surpasses the quality of websites created by their peers who did not have the opportunity to participate in peer feedback activities. Since students extensively analyzed their work after receiving comments and suggestions, made specific corrections, and consequently improved their projects, organizing peer feedback activities in programming courses, especially web programming, should be given more attention.
- 29 April 2025
- Published by FSFEI HE Don State Technical University in International Journal of Cognitive Research in Science, Engineering and Education (IJCRSEE)
- Vol. 13 (1)
Open AccessImpact of Peer Feedback in a Web Programming Course on Students’ Achievement
In addition to learning technical aspects of website creation, students must connect different knowledge, think critically, seek more information, and approach their work from various perspectives. These requirements, or specified competencies, can be developed through providing and receiving peer feedback, which is confirmed as an efficient learning strategy in various empirical studies on different subjects. The aim of this research is to investigate the impact of peer feedback on students’ achievements in the Web Programming Course. We conducted a quantitative study with two groups of students. Students from the experimental group participated in online giving and receiving peer feedback regarding students’ assignments, while students from the control group did not have this opportunity. For evaluating students’ work, we used rubrics. The results indicate that students, through analyzing their peers’ work, providing qualitative assessments, reflecting on their work in line with received comments, and making necessary corrections, create content that surpasses the quality of websites created by their peers who did not have the opportunity to participate in peer feedback activities. Since students extensively analyzed their work after receiving comments and suggestions, made specific corrections, and consequently improved their projects, organizing peer feedback activities in programming courses, especially web programming, should be given more attention.
- Open Access
- 1 January 2025
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Journal of Educational Studies in Mathematics and Computer Science
- Vol. 2 (1) , 56-66
Students' perceptions of peer assessment in a Web programming course: Reflections on feedback, learning, and professional improvement
This paper examines students' perceptions and attitudes toward peer feedback within the course Introduction to Web Programming. The primary aim is to explore how students perceive the contribution of peer evaluation to the enhancement of their projects, the development of reflective thinking, and the strengthening of professional competencies. The research was conducted after the completion of student projects and the peer assessment phase, using a post-activity survey distributed to participating students. The survey was specifically designed to capture students' attitudes and experiences regarding various aspects of the peer feedback process. Responses were analyzed across several categories: technical correctness, visual quality, content relevance of feedback, presentation skills, emotional responses to feedback, sincerity, and reflective engagement. Findings indicate that students generally viewed both giving and receiving peer comments as useful for improving project quality and supporting personal development, especially in relation to evaluation and self-evaluation skills. Moreover, students reported that peer feedback contributed to their critical thinking, boosted self-confidence, and fostered more constructive academic communication. Based on these insights into student perspectives, the study proposes guidelines for the further implementation and improvement of peer assessment practices in technology-related educational settings.
- 1 January 2025
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Journal of Educational Studies in Mathematics and Computer Science
- Vol. 2 (1) , 56-66
Open AccessStudents' perceptions of peer assessment in a Web programming course: Reflections on feedback, learning, and professional improvement
This paper examines students' perceptions and attitudes toward peer feedback within the course Introduction to Web Programming. The primary aim is to explore how students perceive the contribution of peer evaluation to the enhancement of their projects, the development of reflective thinking, and the strengthening of professional competencies. The research was conducted after the completion of student projects and the peer assessment phase, using a post-activity survey distributed to participating students. The survey was specifically designed to capture students' attitudes and experiences regarding various aspects of the peer feedback process. Responses were analyzed across several categories: technical correctness, visual quality, content relevance of feedback, presentation skills, emotional responses to feedback, sincerity, and reflective engagement. Findings indicate that students generally viewed both giving and receiving peer comments as useful for improving project quality and supporting personal development, especially in relation to evaluation and self-evaluation skills. Moreover, students reported that peer feedback contributed to their critical thinking, boosted self-confidence, and fostered more constructive academic communication. Based on these insights into student perspectives, the study proposes guidelines for the further implementation and improvement of peer assessment practices in technology-related educational settings.
- 28 March 2024
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 485
Approximate weak simulations and bisimulations for fuzzy automata over the product structure
- 28 March 2024
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 485
Approximate weak simulations and bisimulations for fuzzy automata over the product structure
- 2 March 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (2) , 269-295
Simulations and bisimulations for max-plus automata
- 2 March 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (2) , 269-295
Simulations and bisimulations for max-plus automata
- 21 August 2023
- Published by Springer Nature
- p. 567-578
Towards New Types of Weak Bisimulations for Fuzzy Automata Using the Product T-Norm
- 21 August 2023
- Published by Springer Nature
- p. 567-578
Towards New Types of Weak Bisimulations for Fuzzy Automata Using the Product T-Norm