Indexing and segmenting colour images using neighbourhood sequences. - András Hajdu; Benedek Nagy; Zoltán Zörgö (ICIP (1), 2003)

SW-type puzzles and their graphs. - Benedek Nagy (Acta Cybern., 2003)

Diagrams and Non-monotonicity in Puzzles. - Benedek Nagy; Gerard Allwein (Diagrams, 2004)

Calculating Distance with Neighborhood Sequences in the Hexagonal Grid. - Benedek Nagy (IWCIA, 2004)

The Languages of SAT and n-SAT over Finitely Many Variables are Regular. - Benedek Nagy (Bull. EATCS, 2004)

Characterization of digital circles in triangular grid. - Benedek Nagy (Pattern Recognit. Lett., 2004)

A Comparison Among Distances Based on Neighborhood Sequences in Regular Grids. - Benedek Nagy (SCIA, 2005)

An algorithm to find the number of the digitizations of discs with a fixed radius. - Benedek Nagy (Electron. Notes Discret. Math., 2005)

On the language equivalence of NE star-patterns. - Benedek Nagy (Inf. Process. Lett., 2005)

Geometry of Neighborhood Sequences in Hexagonal Grid. - Benedek Nagy (DGCI, 2006)

Generating Distance Maps with Neighbourhood Sequences. - Robin Strand; Benedek Nagy; Céline Fouard; Gunilla Borgefors (DGCI, 2006)

Reasoning by Intervals. - Benedek Nagy (Diagrams, 2006)

Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages. - Adrian-Horia Dediu; Renate Klempien-Hinrichs; Hans-Jörg Kreowski; Benedek Nagy (Developments in Language Theory, 2006)

Approximating Euclidean Distance Using Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids. - Benedek Nagy; Robin Strand (IWCIA, 2006)

Membrane Computing and Graphical Operating Systems. - Benedek Nagy; László Szegedi (J. Univers. Comput. Sci., 2006)

On 5' –> 3' Sensing Watson-Crick Finite Automata. - Benedek Nagy (DNA, 2007)

Visual Reasoning by Generalized Interval-values and Interval Temporal Logic. - Benedek Nagy; Sándor Vályi (VLL, 2007)

Optimal strategy in games with chance nodes. - Ervin Melkó; Benedek Nagy (Acta Cybern., 2007)

Distances based on neighbourhood sequences in non-standard three-dimensional grids. - Robin Strand; Benedek Nagy (Discret. Appl. Math., 2007)

Distances with neighbourhood sequences in cubic and triangular grids. - Benedek Nagy (Pattern Recognit. Lett., 2007)

Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms. - Robin Strand; Benedek Nagy (DGCI, 2008)

A Connection between Zn and Generalized Triangular Grids. - Benedek Nagy; Robin Strand (ISVC (2), 2008)

Neighborhood Sequences in the Diamond Grid. - Benedek Nagy; Robin Strand (IWCIA Special Track on Applications, 2008)

Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids - Parameter Optimization. - Robin Strand; Benedek Nagy (IWCIA, 2008)

Distance with generalized neighbourhood sequences in n D and infinity D. - Benedek Nagy (Discret. Appl. Math., 2008)

Non-Traditional Grids Embedded in Zn. - Benedek Nagy; Robin Strand (Int. J. Shape Model., 2008)

Scattered Subword Complexity of non-Primitive Words. - Szilárd Zsolt Fazekas; Benedek Nagy (J. Autom. Lang. Comb., 2008)

Interval-valued computations and their connection with PSPACE. - Benedek Nagy; Sándor Vályi (Theor. Comput. Sci., 2008)

Permutation Languages in Formal Linguistics. - Benedek Nagy (IWANN (1), 2009)

Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids. - Benedek Nagy; Robin Strand (IWCIA, 2009)

Neighborhood Sequences in the Diamond Grid - Algorithms with Four Neighbors. - Benedek Nagy; Robin Strand (IWCIA, 2009)

5' → 3' Watson-Crick Automata with Several Runs. - Peter Leupold; Benedek Nagy (NCMA, 2009)

Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids. - Robin Strand; Benedek Nagy (Discret. Appl. Math., 2009)

Neighborhood sequences in the diamond grid: Algorithms with two and three neighbors. - Benedek Nagy; Robin Strand (Int. J. Imaging Syst. Technol., 2009)

Languages Generated by Context-Free Grammars Extended by Type AB → BA Rules. - Benedek Nagy (J. Autom. Lang. Comb., 2009)

Stateless multicounter 5′ → 3′ Watson-Crick automata. - Ömer Egecioglu; László Hegedüs; Benedek Nagy (BIC-TA, 2010)

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. - Benedek Nagy; Friedrich Otto (LATA, 2010)

An Automata-Theoretic Characterization of the Chomsky-Hierarchy. - Benedek Nagy (TAMC, 2010)

Approximating the Euclidean circle in the square grid using neighbourhood sequences - János Farkas; Szabolcs Baják; Benedek Nagy (CoRR, 2010)

Pumping lemmas for linear and nonlinear context-free languages - Géza Horváth; Benedek Nagy (CoRR, 2010)

5' -> 3' Watson-Crick AutomataWith Several Runs. - Peter Leupold; Benedek Nagy (Fundam. Informaticae, 2010)

Discrete tomography on the triangular grid: a memetic approach. - Elisa Valentina Moisi; Benedek Nagy (ISPA, 2011)

A weighted neighbourhood sequence distance function with three local steps. - Robin Strand; Benedek Nagy (ISPA, 2011)

Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata. - Benedek Nagy; László Hegedüs; Ömer Egecioglu (IWANN (1), 2011)

Isoperimetrically Optimal Polygons in the Triangular Grid. - Benedek Nagy; Krisztina Barczi (IWCIA, 2011)

Globally Deterministic CD-Systems of Stateless R(1)-Automata. - Benedek Nagy; Friedrich Otto (LATA, 2011)

Pushdown Automata with Translucent Pushdown Symbols. - Benedek Nagy; Friedrich Otto; Marcel Vollweiler (NCMA, 2011)

An Automata-Theoretical Characterization of Context-Free Trace Languages. - Benedek Nagy; Friedrich Otto (SOFSEM, 2011)

Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. - Ömer Egecioglu; László Hegedüs; Benedek Nagy (Fundam. Informaticae, 2011)

CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. - Benedek Nagy; Friedrich Otto (RAIRO Theor. Informatics Appl., 2011)

On CD-Systems of Stateless Deterministic R(2)-Automata. - Benedek Nagy (J. Autom. Lang. Comb., 2011)

Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid. - Benedek Nagy; Robin Strand (Theor. Comput. Sci., 2011)

Digital distance functions on three-dimensional grids. - Robin Strand; Benedek Nagy; Gunilla Borgefors (Theor. Comput. Sci., 2011)

Solving Application Oriented Graph Theoretical Problems with DNA Computing. - Veronika Halász; László Hegedüs; István Hornyák; Benedek Nagy (BIC-TA (1), 2012)

On Union-Free and Deterministic Union-Free Languages. - Galina Jirásková; Benedek Nagy (IFIP TCS, 2012)

Energy-Minimization Based Discrete Tomography Reconstruction Method for Images on Triangular Grid. - Tibor Lukic; Benedek Nagy (IWCIA, 2012)

Cellular Topology on the Triangular Grid. - Benedek Nagy (IWCIA, 2012)

On Efficient Algorithms for SAT. - Benedek Nagy (Int. Conf. on Membrane Computing, 2012)

Reconstruction of Binary Images Represented on Equilateral Triangular Grid Using Evolutionary Algorithms. - Elisa Valentina Moisi; Vladimir-Ioan Cretu; Benedek Nagy (SOFA, 2012)

Computing discrete logarithm by interval-valued paradigm. - Benedek Nagy; Sándor Vályi (DCM, 2012)

On CD-systems of stateless deterministic R-automata with window size one. - Benedek Nagy; Friedrich Otto (J. Comput. Syst. Sci., 2012)

Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case. - László Hegedüs; Benedek Nagy; Ömer Egecioglu (Nat. Comput., 2012)

Linguistic Applications of Finite Automata with Translucent Letters. - Benedek Nagy; László Kovács (ICAART (1), 2013)

Discrete tomography on the triangular grid based on Ryser's results. - Benedek Nagy; Elisa Valentina Moisi; Vladimir-Ioan Cretu (ISPA, 2013)

A Weight Sequence Distance Function. - Benedek Nagy; Robin Strand; Nicolas Normand (ISMM, 2013)

Maximum flow minimum cost algorithm for reconstruction of images represented on the triangular grid. - Elisa Valentina Moisi; Benedek Nagy; Vladimir-Ioan Cretu (SACI, 2013)

On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata - (Extended Abstract). - László Hegedüs; Benedek Nagy (UCNC, 2013)

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. - Benedek Nagy; Friedrich Otto (Acta Informatica, 2013)

Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary. - Benedek Nagy; Krisztina Barczi (Int. J. Comput. Math., 2013)

Globally deterministic CD-systems of stateless R-automata with window size 1. - Benedek Nagy; Friedrich Otto (Int. J. Comput. Math., 2013)

On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languages. - Benedek Nagy (J. Log. Comput., 2013)

Generalized game trees and their evaluation. - Raed Basbous; Benedek Nagy (CogInfoCom, 2014)

A Graphical Representation of Boolean Logic. - Beáta Bojda; Katalin Bubnó; Benedek Nagy; Viktor Takács (Diagrams, 2014)

Graphical Representations of Context-Free Languages. - Benedek Nagy (Diagrams, 2014)

Binary Tomography on the Triangular Grid with 3 Alternative Directions - A Genetic Approach. - Benedek Nagy; Elisa Valentina Moisi (ICPR, 2014)

Weighted Distances on a Triangular Grid. - Benedek Nagy (IWCIA, 2014)

Visualization and Efficiency in Teaching Mathematics. - Beáta Bojda; Katalin Bubnó; Benedek Nagy; Viktor Takács (SOCO-CISIS-ICEUTE, 2014)

Modeling Syntactic Complexity with P Systems: A Preview. - Gemma Bel Enguix; Benedek Nagy (UCNC, 2014)

Representations of Circular Words. - László Hegedüs; Benedek Nagy (AFL, 2014)

Deterministic discrete tomography reconstruction by energy minimization method on the triangular grid. - Tibor Lukic; Benedek Nagy (Pattern Recognit. Lett., 2014)

Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory. - Benedek Nagy; László Kovács (Trans. Comput. Collect. Intell., 2014)

A Combinatorial 4-Coordinate System for the Diamond Grid. - Lidija Comic; Benedek Nagy (ISMM, 2015)

Wiener Index on Lines of Unit Cells of the Body-Centered Cubic Grid. - Hamzeh Mujahed; Benedek Nagy (ISMM, 2015)

Finiteness of chain-code picture languages on the triangular grid. - Gergely T. Balint; Benedek Nagy (ISPA, 2015)

A combinatorial 3-coordinate system for the face centered cubic grid. - Lidija Comic; Benedek Nagy (ISPA, 2015)

Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods. - Mousumi Dutt; Arindam Biswas 002; Benedek Nagy (IWCIA, 2015)

A Characterization of NP Within Interval-Valued Computing. - Benedek Nagy; Sándor Vályi (MCU, 2015)

On language families generated by controlled grammars. - Dávid Angyal; Benedek Nagy (NCMA, 2015)

A family of two-head pushdown automata. - Benedek Nagy (NCMA, 2015)

Comparing memetic and simulated annealing approaches for discrete tomography on the triangular grid. - Elisa Valentina Moisi; Tibor Lukic; Benedek Nagy; Vladimir-Ioan Cretu (SACI, 2015)

Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids. - Benedek Nagy (Ann. Math. Artif. Intell., 2015)

Concepts of Binary Morphological Operations Dilation and Erosion on the Triangular Grid. - Mohsen Abdalla; Benedek Nagy (CompIMAGE, 2016)

On Weighted Distances on the Khalimsky Grid. - Gergely Kovács; Benedek Nagy; Béla Vizvári (DGCI, 2016)

Number of Words Characterizing Digital Balls on the Triangular Tiling. - Benedek Nagy (DGCI, 2016)

Digital Disks by Weighted Distances in the Triangular Grid. - Benedek Nagy; Hamid Mir Mohammad Sadeghi (DGCI, 2016)

Fast evaluations in product logic various pruning techniques. - Raed Basbous; Tibor Tajti; Benedek Nagy (FUZZ-IEEE, 2016)

A combinatorial coordinate system for the body-centered cubic grid. - Lidija Comic; Benedek Nagy (Graph. Model., 2016)

On periodic properties of circular words. - László Hegedüs; Benedek Nagy (Discret. Math., 2016)

Dense Projection Tomography on the Triangular Tiling. - Benedek Nagy; Tibor Lukic (Fundam. Informaticae, 2016)

A topological 4-coordinate system for the face centered cubic grid. - Lidija Comic; Benedek Nagy (Pattern Recognit. Lett., 2016)

Weighted Distances on the Trihexagonal Grid. - Gergely Kovács; Benedek Nagy; Béla Vizvári (DGCI, 2017)

An Integer Programming Approach to Characterize Digital Disks on the Triangular Grid. - Gergely Kovács; Benedek Nagy; Béla Vizvári (DGCI, 2017)

On the Chamfer Polygons on the Triangular Grid. - Hamid Mir Mohammad Sadeghi; Benedek Nagy (IWCIA, 2017)

Trajectories and Traces on Non-traditional Regular Tessellations of the Plane. - Benedek Nagy; Arif A. Akkeles (IWCIA, 2017)

An extension of the LR parsing algorithm for two-head pushdown automata. - Dávid Angyal; Benedek Nagy (NCMA, 2017)

Memetic algorithms for reconstruction of binary images on triangular grids with 3 and 6 projections. - Benedek Nagy; Elisa Valentina Moisi (Appl. Soft Comput., 2017)

A New Sensing 5'->3' Watson-Crick Automata Concept. - Benedek Nagy; Shaghayegh Parchami; Hamid Mir Mohammad Sadeghi (AFL, 2017)

Application of neighborhood sequences in communication of hexagonal networks. - Benedek Nagy (Discret. Appl. Math., 2017)

Preface / Editorial. - Jérôme Durand-Lose; Jarkko Kari; Benedek Nagy (Fundam. Informaticae, 2017)

A Shift-free Characterization of NP within Interval-valued Computing. - Benedek Nagy; Sándor Vályi (Fundam. Informaticae, 2017)

Weighted Distances and Digital Disks on the Khalimsky Grid - Disks with Holes and Islands. - Gergely Kovács; Benedek Nagy; Béla Vizvári (J. Math. Imaging Vis., 2017)

Digitized Rotations of Closest Neighborhood on the Triangular Grid. - Aydin Avkan; Benedek Nagy; Müge Saadetoglu (IWCIA, 2018)

Binary Tomography on Triangular Grid Involving Hexagonal Grid Approach. - Benedek Nagy; Tibor Lukic (IWCIA, 2018)

An Extension of Interval-Valued Computing Equivalent to Red-Green Turing Machines. - Benedek Nagy; Sándor Vályi (MCU, 2018)

A jumping 5' → 3' Watson-Crick finite automata model. - Radim Kocman; Benedek Nagy; Zbynek Krivka; Alexander Meduna (NCMA, 2018)

Deterministic Sensing 5' rightarrow 3' 5 ′ → 3 ′ Watson-Crick Automata Without Sensing Parameter. - Shaghayegh Parchami; Benedek Nagy (UCNC, 2018)

Dilation and Erosion on the Triangular Tessellation: An Independent Approach. - Mohsen Abdalla; Benedek Nagy (IEEE Access, 2018)

Counting of Shortest Paths in Cubic Grid. - Mousumi Dutt; Arindam Biswas 002; Benedek Nagy (CoRR, 2018)

A description of the diamond grid for topological and combinatorial analysis. - Lidija Comic; Benedek Nagy (Graph. Model., 2018)

Preface: Non-classical models of automata and applications VIII. - Henning Bordihn; Benedek Nagy; György Vaszil (RAIRO Theor. Informatics Appl., 2018)

On the Complexity of a Mildly Context-Sensitive Language Class. - Dávid Angyal; Benedek Nagy; György Vaszil (J. Autom. Lang. Comb., 2018)

Distance Functions Based on Multiple Types of Weighted Steps Combined with Neighborhood Sequences. - Benedek Nagy; Robin Strand; Nicolas Normand (J. Math. Imaging Vis., 2018)

Union-Freeness, Deterministic Union-Freeness and Union-Complexity. - Benedek Nagy (DCFS, 2019)

Distance Transform Based on Weight Sequences. - Benedek Nagy; Robin Strand; Nicolas Normand (DGCI, 2019)

On the Angles of Change of the Neighborhood Motion Maps on the Triangular Grid. - Aydin Avkan; Benedek Nagy; Müge Saadetoglu (ISPA, 2019)

On simple 5' → 3' sensing Watson-Crick finite-state transducers. - Benedek Nagy; Zita Kovács (NCMA, 2019)

Two-Head Finite-State Acceptors with Translucent Letters. - Benedek Nagy; Friedrich Otto (SOFSEM, 2019)

Lazy evaluations in Łukasiewicz type fuzzy logic. - Benedek Nagy; Raed Basbous; Tibor Tajti (Fuzzy Sets Syst., 2019)

Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach. - Gergely Kovács; Benedek Nagy; Béla Vizvári (J. Comb. Optim., 2019)

A Continuous Coordinate System for the Plane by Triangular Symmetry. - Benedek Nagy; Khaled H. Abuhmaidan (Symmetry, 2019)

Digitized rotations of 12 neighbors on the triangular grid. - Aydin Avkan; Benedek Nagy; Müge Saadetoglu (Ann. Math. Artif. Intell., 2020)

On disks of the triangular grid: An application of optimization theory in discrete geometry. - Gergely Kovács; Benedek Nagy; Béla Vizvári (Discret. Appl. Math., 2020)

Binary tomography on the isometric tessellation involving pixel shape orientation. - Benedek Nagy; Tibor Lukic (IET Image Process., 2020)

On the Membership Problem of Permutation Grammars - A Direct Proof of NP-Completeness. - Benedek Nagy (Int. J. Found. Comput. Sci., 2020)

5′→3′ Watson-Crick pushdown automata. - Benedek Nagy (Inf. Sci., 2020)

Linear automata with translucent letters and linear context-free trace languages. - Benedek Nagy; Friedrich Otto (RAIRO Theor. Informatics Appl., 2020)

Mathematical Morphology on the Triangular Grid: The Strict Approach. - Mohsen Abdalla; Benedek Nagy (SIAM J. Imaging Sci., 2020)

Digital Geometry on the Dual of Some Semi-regular Tessellations. - Mohammadreza Saadat; Benedek Nagy (DGMM, 2021)

Generating Patterns on the Triangular Grid by Cellular Automata including Alternating Use of Two Rules. - Mohammadreza Saadat; Benedek Nagy (ISPA, 2021)

On deterministic sensing $5' rightarrow 3'$ Watson-Crick finite automata: a full hierarchy in 2detLIN. - Benedek Nagy; Shaghayegh Parchami (Acta Informatica, 2021)

Vector Arithmetic in the Triangular Grid. - Khaled H. Abuhmaidan; Monther Aldwairi; Benedek Nagy (Entropy, 2021)

Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines. - Benedek Nagy; Sándor Vályi (Fundam. Informaticae, 2021)

Union-Freeness Revisited - Between Deterministic and Nondeterministic Union-Free Languages. - Benedek Nagy (Int. J. Found. Comput. Sci., 2021)

On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers. - Benedek Nagy; Zita Kovács (RAIRO Theor. Informatics Appl., 2021)

State-deterministic $5' rightarrow 3'$ Watson-Crick automata. - Benedek Nagy (Nat. Comput., 2021)

Distance on the Cairo pattern. - Gergely Kovács; Benedek Nagy; Neset Deniz Turgay (Pattern Recognit. Lett., 2021)

Weighted distances on the truncated hexagonal grid. - Gergely Kovács; Benedek Nagy; Béla Vizvári (Pattern Recognit. Lett., 2021)

Union-Complexities of Kleene Plus Operation. - Benedek Nagy (DCFS, 2022)

A Comparison of 2D Regular Grids based on Digital Continuity of Rotations. - Aydin Avkan; Benedek Nagy; Müge Saadetoglu (ISAIM, 2022)

Non-traditional 2D Grids in Combinatorial Imaging - Advances and Challenges. - Benedek Nagy (IWCIA, 2022)

From Finite Automata to Fractal Automata - The Power of Recursion. - Benedek Nagy (MCU, 2022)

A jumping $5' rightarrow 3'$ Watson-Crick finite automata model. - Radim Kocman; Zbynek Krivka; Alexander Meduna; Benedek Nagy (Acta Informatica, 2022)

A Comparison of Various Extensions of Strong Truthteller and Strong Liar Puzzles (Mutes and Crazies). - Laith Alzboon; Benedek Nagy (Axioms, 2022)

Quasi-deterministic 5' -> 3' Watson-Crick Automata. - Benedek Nagy (NCMA, 2022)

Operational union-complexity. - Benedek Nagy (Inf. Comput., 2022)

$5' rightarrow 3'$ Watson-Crick automata languages-without sensing parameter. - Benedek Nagy; Shaghayegh Parchami (Nat. Comput., 2022)

Digital geometry on a cubic stair-case mesh. - Benedek Nagy; Mohammadreza Saadat (Pattern Recognit. Lett., 2022)

A comparison of digitized rotations of neighborhood motion maps of closest neighbors on 2D regular grids. - Aydin Avkan; Benedek Nagy; Müge Saadetoglu (Signal Image Video Process., 2022)

On the Size of the Bijective Regions in Digital Rotations on the Hexagonal Grid. - Müge Saadetoglu; Aydin Avkan; Benedek Nagy; Mohammadreza Saadat (ISPA, 2023)

State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters. - Benedek Nagy (AFL, 2023)

On Languages Generated by Signed Grammars. - Ömer Egecioglu; Benedek Nagy (NCMA, 2023)

Weighted distances in the Cairo pattern. - Neset Deniz Turgay; Benedek Nagy; Gergely Kovács; Béla Vizvári (Pattern Recognit. Lett., 2023)

A digital geometry on the tetrakis square tiling - Distance and coarsening. - Benedek Nagy (Trans. GIS, 2023)

Weighted distances and distance transforms on the triangular tiling. - Benedek Nagy (Trans. GIS, 2023)

A Khalimsky-Like Topology on the Triangular Grid. - Benedek Nagy (DGMM, 2024)

Finite Automata with Sets of Translucent Words. - Benedek Nagy; Friedrich Otto (DLT, 2024)

5' -> 3' Watson-Crick Automata accepting Necklaces. - Benedek Nagy (NCMA, 2024)

Digital continuity of rotations in the 2D regular grids. - Müge Saadetoglu; Benedek Nagy; Aydin Avkan (Ann. Math. Artif. Intell., 2024)

Changes in Tourists' Perceptions of Community-Based Ecotourism (CBET) After COVID-19 Pandemic: A Study on the Country of Origin and Economic Development Level. - Flavia Dana Oltean; Petru Alexandru Curta; Benedek Nagy; Arzu Huseyn; Manuela Rozalia Gabor (ISPRS Int. J. Geo Inf., 2025)

Minimal Path-Generated Distances on the Trihexagonal Grid Having Four Neighborhoods. - Gergely Kovács; Benedek Nagy; Béla Vizvári (Trans. GIS, 2025)

A Myhill-Nerode Type Characterization of 2detLIN Languages. - Benedek Nagy (CoRR, 2025)

On some Classes of Reversible 2-head Automata. - Benedek Nagy; Walaa Yasin (CoRR, 2025)