Apostolos Syropoulos
Research Subjects
Research Interests
Apostolos Syropoulos has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Binod Kumar Sharma
Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, India
4 shared publications Ioannis Papadopoulos
Metropolitan College, Greece
3 shared publicationsAthanasios T. Stavrianos
2nd Technical Vocational School of Xanthi, Greece
2 shared publicationsBasil K. Papadopoulos
Democritus University of Thrace
2 shared publications- Basil Papadopoulos
Section of Mathematics, Programming and General Courses, Department of Civil Engineering, School of Engineering, Democritus University of Thrace, 67100 Xanthi, Greece
2 shared publications Christos K. K. Loverdos
2 shared publications
Latest Publications
- 24 April 2026
- Published by Winaya Inspirasi Nusantara Foundation in Journal of Analytical Uncertainty
- Vol. 1 (2) , 1-5
Erdős–Rényi Models and Neutrosophic Sets
Networks comprise a vast array of diverse entities, including organizations, computers, airports, and more. The elements are interconnected either physically (e.g., through cables or microwaves) or mentally, when they pertain to ideas or concepts. In the broadest context, the linkages exhibit no discernible pattern. Graphs are mathematical constructs utilized to represent networks and analyze their characteristics. A random graph is one in which a stochastic process dictates the existence of an edge between two vertices. An Erdős–Rényi model is a framework for generating random graphs or examining the evolution of a random graph. Substituting likelihood with plausibility results in a fundamentally distinct framework that can be mathematically characterized using fuzzy graphs. In addition, we gain far more flexibility by adding a measure of the opposite of plausibility and a measure of indeterminacy. This naturally leads to a reinterpretation of established concepts and ideas and the framework of neutrosophic set theory.
- 24 April 2026
- Published by Winaya Inspirasi Nusantara Foundation in Journal of Analytical Uncertainty
- Vol. 1 (2) , 1-5
Erdős–Rényi Models and Neutrosophic Sets
Networks comprise a vast array of diverse entities, including organizations, computers, airports, and more. The elements are interconnected either physically (e.g., through cables or microwaves) or mentally, when they pertain to ideas or concepts. In the broadest context, the linkages exhibit no discernible pattern. Graphs are mathematical constructs utilized to represent networks and analyze their characteristics. A random graph is one in which a stochastic process dictates the existence of an edge between two vertices. An Erdős–Rényi model is a framework for generating random graphs or examining the evolution of a random graph. Substituting likelihood with plausibility results in a fundamentally distinct framework that can be mathematically characterized using fuzzy graphs. In addition, we gain far more flexibility by adding a measure of the opposite of plausibility and a measure of indeterminacy. This naturally leads to a reinterpretation of established concepts and ideas and the framework of neutrosophic set theory.
- 31 March 2025
- Published by Springer Nature
- p. 383-402
Neutrosophic Sets and the Production and Distribution of Electricity
- 31 March 2025
- Published by Springer Nature
- p. 383-402
Neutrosophic Sets and the Production and Distribution of Electricity
- 26 February 2025
- Published by Springer Nature
- p. 13-27
A Précis of Basic Set Theory
- 26 February 2025
- Published by Springer Nature
- p. 29-69
Fuzzy Subsets
- 26 February 2025
- Published by Springer Nature
- p. 71-92
Fuzzy Numbers and Linguistic Variables
- 26 February 2025
- Published by Springer Nature
- p. 1-12
On Vagueness
- 11 December 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 22 (02) , 593-628
On Characterization of Algebraic Structure of Fuzzy Multiset Finite Automata
This paper enriches the theory of computing in the context of fuzzy sets and multisets. We have studied the computational model fuzzy multiset finite automaton (FMFA), which incorporates uncertainty about the next state of transition and multiple occurrences in the input set of automaton, and can be viewed as a generalized version of both classical automaton and fuzzy automaton. We have discussed the algebraic characterization of subautomaton of a FMFA, separatedness, strong connectedness and cyclic, directable and triangular FMFA in terms of equivalence classes induced by an equivalence relation defined on the state set of FMFA. Interestingly, for a given FMFA, a new FMFA is constructed which is a homomorphic image of the original FMFA. We have defined different poset structures associated with a given FMFA and showed that some of them are upper semilattices and discussed the inter-relationship of a given poset, a finite upper semilattice (FUSL), a FMFA and a poset/FUSL associated with a given FMFA. Finally, we have introduced the concept of decomposition of a FMFA in two different ways and characterized the strongly connected, triangular and directable FMFA.
- 11 December 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 22 (02) , 593-628
On Characterization of Algebraic Structure of Fuzzy Multiset Finite Automata
This paper enriches the theory of computing in the context of fuzzy sets and multisets. We have studied the computational model fuzzy multiset finite automaton (FMFA), which incorporates uncertainty about the next state of transition and multiple occurrences in the input set of automaton, and can be viewed as a generalized version of both classical automaton and fuzzy automaton. We have discussed the algebraic characterization of subautomaton of a FMFA, separatedness, strong connectedness and cyclic, directable and triangular FMFA in terms of equivalence classes induced by an equivalence relation defined on the state set of FMFA. Interestingly, for a given FMFA, a new FMFA is constructed which is a homomorphic image of the original FMFA. We have defined different poset structures associated with a given FMFA and showed that some of them are upper semilattices and discussed the inter-relationship of a given poset, a finite upper semilattice (FUSL), a FMFA and a poset/FUSL associated with a given FMFA. Finally, we have introduced the concept of decomposition of a FMFA in two different ways and characterized the strongly connected, triangular and directable FMFA.
- 17 October 2024
- Published by IGI Global Scientific Publishing
- p. 243-256
Game-Based Education in Experimental Sciences
Game-based education is a teaching method that utilizes computer games in the learning process. A game is a mini-world where students learn about specific concepts and ideas. In experimental sciences, one has to teach students by demonstration but sometimes this is not possible. When this is the case, an educator can use specially designed computer games and/or animations that can be used in the teaching process. Although, one can learn a lot from such games, we believe that students who design such games get a much deeper understanding of the relevant theory. We describe why this is a better approach and show by means of a mini-experiment how one can employ this idea in practice.
- 17 October 2024
- Published by IGI Global Scientific Publishing
- p. 243-256
Game-Based Education in Experimental Sciences
Game-based education is a teaching method that utilizes computer games in the learning process. A game is a mini-world where students learn about specific concepts and ideas. In experimental sciences, one has to teach students by demonstration but sometimes this is not possible. When this is the case, an educator can use specially designed computer games and/or animations that can be used in the teaching process. Although, one can learn a lot from such games, we believe that students who design such games get a much deeper understanding of the relevant theory. We describe why this is a better approach and show by means of a mini-experiment how one can employ this idea in practice.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3030 (1)
Pragmatic quantum computing for science and engineering
Based on an idea by Richard Feynman, quantum computing is a relatively new technological innovation that promises to very quickly solve problems that one usuall
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3030 (1)
Pragmatic quantum computing for science and engineering
Based on an idea by Richard Feynman, quantum computing is a relatively new technological innovation that promises to very quickly solve problems that one usuall
- Open Access
- 25 November 2023
- Published by Birlesik Dunya Yenilik Arastirma ve Yayincilik Merkezi in Global Journal of Foreign Language Teaching
- Vol. 13 (4) , 223-235
Using computational thinking to teach foreign languages: A preliminary approach
Computational thinking is a teaching methodology that has been successfully applied to STEM education. However, its use outside STEM education seems to be quite limited. This study aims to report a small-scale experiment in which a small group of students were taught elements of the Greek language using STEM education methodology. Since computational thinking is mainly about algorithms and their use in teaching, the study has used some tools to implement the corresponding ideas. The results of this project are encouraging and the study indicates that language learning can greatly benefit from using computational thinking. Keywords: Abstraction; Algorithm; Computational Thinking; Language Learning; Teaching.
- 25 November 2023
- Published by Birlesik Dunya Yenilik Arastirma ve Yayincilik Merkezi in Global Journal of Foreign Language Teaching
- Vol. 13 (4) , 223-235
Open AccessUsing computational thinking to teach foreign languages: A preliminary approach
Computational thinking is a teaching methodology that has been successfully applied to STEM education. However, its use outside STEM education seems to be quite limited. This study aims to report a small-scale experiment in which a small group of students were taught elements of the Greek language using STEM education methodology. Since computational thinking is mainly about algorithms and their use in teaching, the study has used some tools to implement the corresponding ideas. The results of this project are encouraging and the study indicates that language learning can greatly benefit from using computational thinking. Keywords: Abstraction; Algorithm; Computational Thinking; Language Learning; Teaching.