György Vaszil
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
György Vaszil has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Erzsébet Csuhaj-Varjú
Department of Algorithms and Their Applications, Faculty of Informatics, ELTE Eötvös Loránd University, Budapest, Hungary
10 shared publications - Péter Battyányi
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary
6 shared publications - Anna Kuczik
Faculty of Informatics, University of Debrecen, Debrecen, Hungary
3 shared publications Kristóf Kántor
University of Debrecen
3 shared publications- András Murvai
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary
2 shared publications - Henning Bordihn
Institut für Informatik, Universität Potsdam, An der Bahn 2, 14467 Potsdam, Germany
2 shared publications
Latest Publications
- Open Access
- 20 May 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1080
Three-valued minimal semantic parsing of boolean grammars
- 20 May 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1080
Open AccessThree-valued minimal semantic parsing of boolean grammars
- Open Access
- 24 October 2025
- Published by Springer Nature in Acta Informatica
- Vol. 62 (4) , 1-20
Watson-Crick finite automata of small size and variants of string assembling systems
We investigate the relationship of languages characterized by variants of string assembling systems and by Watson-Crick finite automata with a small number of states. Besides the general variant, we consider so-called free, and pure string assembling systems and compare their language generating power to Watson-Crick finite automata having one state (also called stateless) and two or three states in their state sets. We also study restricted variants of models that describe unary languages.
- 24 October 2025
- Published by Springer Nature in Acta Informatica
- Vol. 62 (4) , 1-20
Open AccessWatson-Crick finite automata of small size and variants of string assembling systems
We investigate the relationship of languages characterized by variants of string assembling systems and by Watson-Crick finite automata with a small number of states. Besides the general variant, we consider so-called free, and pure string assembling systems and compare their language generating power to Watson-Crick finite automata having one state (also called stateless) and two or three states in their state sets. We also study restricted variants of models that describe unary languages.
- 29 June 2025
- Published by Springer Nature
- p. 94-107
Matrix Forbidding Grammars
- Open Access
- 13 June 2025
- Published by Springer Nature in Natural Computing
- p. 1-12
Characterizing languages of polymorphic P systems by parallel communicating Lindenmayer systems
We continue the investigation of the computational power of non-cooperative polymorphic P systems with no ingredients (no target indicators or any special features added to the rules) in terms of parallel communicating Lindenmayer systems. We precisely characterize the language class generated by these types of P systems using a restricted class of parallel communicating ET0L systems. Our results demonstrate that the dynamically changing rewriting rules provided by the polymorphic framework in non-cooperating P systems results in a similar increase in computational power as a restricted variant of the parallel communicating framework does in the power of ET0L systems.
- 13 June 2025
- Published by Springer Nature in Natural Computing
- p. 1-12
Open AccessCharacterizing languages of polymorphic P systems by parallel communicating Lindenmayer systems
We continue the investigation of the computational power of non-cooperative polymorphic P systems with no ingredients (no target indicators or any special features added to the rules) in terms of parallel communicating Lindenmayer systems. We precisely characterize the language class generated by these types of P systems using a restricted class of parallel communicating ET0L systems. Our results demonstrate that the dynamically changing rewriting rules provided by the polymorphic framework in non-cooperating P systems results in a similar increase in computational power as a restricted variant of the parallel communicating framework does in the power of ET0L systems.
- Open Access
- 3 April 2025
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 7 (3) , 312-325
Non-cooperative polymorphic P systems and parallel communicating ET0L systems
We demonstrate that languages of non-cooperative polymorphic P systems with no ingredients (with no special features and no target indicators in the rules) can be generated by nonreturning parallel communicating ET0L systems, and discuss a further topic for research, namely the identification of the subclass of parallel communicating ET0L systems for which the converse of the statement holds, that is, the precise characterization of languages of non-cooperative polymorphic P systems in terms of the parallel communicating Lindenmayer system model.
- 3 April 2025
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 7 (3) , 312-325
Open AccessNon-cooperative polymorphic P systems and parallel communicating ET0L systems
We demonstrate that languages of non-cooperative polymorphic P systems with no ingredients (with no special features and no target indicators in the rules) can be generated by nonreturning parallel communicating ET0L systems, and discuss a further topic for research, namely the identification of the subclass of parallel communicating ET0L systems for which the converse of the statement holds, that is, the precise characterization of languages of non-cooperative polymorphic P systems in terms of the parallel communicating Lindenmayer system model.
- 18 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (03) , 247-267
Leftmost Derivations in CD Grammar Systems
We investigate the power of CD grammar systems using different types of leftmost derivations for all standard cooperation strategies including the so-called full-competence mode of derivation. It is proved that, for some types of leftmost restrictions and cooperation strategies, CD grammar systems generate the same language classes as in the unrestricted, “non-leftmost” case, but the generative power is also increased or decreased in several cases. Thereby, some new relations to well-known Chomsky and Lindenmayer classes are presented.
- 18 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (03) , 247-267
Leftmost Derivations in CD Grammar Systems
We investigate the power of CD grammar systems using different types of leftmost derivations for all standard cooperation strategies including the so-called full-competence mode of derivation. It is proved that, for some types of leftmost restrictions and cooperation strategies, CD grammar systems generate the same language classes as in the unrestricted, “non-leftmost” case, but the generative power is also increased or decreased in several cases. Thereby, some new relations to well-known Chomsky and Lindenmayer classes are presented.
- 26 February 2025
- Published by Springer Nature
- p. 89-102
On the Power of Small Watson-Crick Automata and Variants of String Assembling Systems
- 26 February 2025
- Published by Springer Nature
- p. 89-102
On the Power of Small Watson-Crick Automata and Variants of String Assembling Systems
- Open Access
- 10 September 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 407, 27-43
A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation
Boolean grammars generalize context-free rewriting by extending the possibilities when dealing with different rules for the same nonterminal symbol. By allowing not only disjunction (as in the case of usual context-free grammars), but also conjunction and negation as possible connections between different rules with the same left-hand side, they are able to simplify the description of context-free languages and characterize languages that are not context-free. The use of negation, however, leads to the possibility of introducing rules that interplay in such a way which is problematic to handle in the classical, two-valued logical setting. Here we define a three valued interpretation to deal with such contradictory grammars using a method introduced originally in the context of logic programming, and present an algorithm to determine the membership status of strings with respect to the resulting three valued languages.
- 10 September 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 407, 27-43
Open AccessA GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation
Boolean grammars generalize context-free rewriting by extending the possibilities when dealing with different rules for the same nonterminal symbol. By allowing not only disjunction (as in the case of usual context-free grammars), but also conjunction and negation as possible connections between different rules with the same left-hand side, they are able to simplify the description of context-free languages and characterize languages that are not context-free. The use of negation, however, leads to the possibility of introducing rules that interplay in such a way which is problematic to handle in the classical, two-valued logical setting. Here we define a three valued interpretation to deal with such contradictory grammars using a method introduced originally in the context of logic programming, and present an algorithm to determine the membership status of strings with respect to the resulting three valued languages.
- Open Access
- 8 May 2024
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 6 (3) , 179-192
Simple variants of non-cooperative polymorphic P systems
We investigate the computational power of non-cooperative polymorphic P systems with no additional ingredients. The variants we study are even more simple in the sense that the sets of possible right-hand sides of the dynamically changing rules are finite. We show that systems with this type of restriction characterize exactly the class of Parikh sets of ET0L languages.
- 8 May 2024
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 6 (3) , 179-192
Open AccessSimple variants of non-cooperative polymorphic P systems
We investigate the computational power of non-cooperative polymorphic P systems with no additional ingredients. The variants we study are even more simple in the sense that the sets of possible right-hand sides of the dynamically changing rules are finite. We show that systems with this type of restriction characterize exactly the class of Parikh sets of ET0L languages.
- Open Access
- 12 March 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 995
Networks of Watson-Crick D0L systems with communication by substrings
- 12 March 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 995
Open AccessNetworks of Watson-Crick D0L systems with communication by substrings