default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenedek Nagy
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j73]Müge Saadetoglu, Benedek Nagy, Aydin Avkan:
Digital continuity of rotations in the 2D regular grids. Ann. Math. Artif. Intell. 92(1): 115-137 (2024)- [c93]Benedek Nagy:
A Khalimsky-Like Topology on the Triangular Grid. DGMM 2024: 150-162 - [c92]Benedek Nagy, Friedrich Otto:
Finite Automata with Sets of Translucent Words. DLT 2024: 236-251 - [c91]Benedek Nagy:
5' -> 3' Watson-Crick Automata accepting Necklaces. NCMA 2024: 168-185 - 2023
- [j72]Neset Deniz Turgay
, Benedek Nagy, Gergely Kovács, Béla Vizvári:
Weighted distances in the Cairo pattern. Pattern Recognit. Lett. 166: 105-111 (2023) - [j71]Benedek Nagy:
A digital geometry on the tetrakis square tiling - Distance and coarsening. Trans. GIS 27(2): 388-407 (2023) - [j70]Benedek Nagy:
Weighted distances and distance transforms on the triangular tiling. Trans. GIS 27(7): 2042-2098 (2023) - [c90]Müge Saadetoglu, Aydin Avkan, Benedek Nagy, Mohammadreza Saadat:
On the Size of the Bijective Regions in Digital Rotations on the Hexagonal Grid. ISPA 2023: 1-6 - [c89]Ömer Egecioglu, Benedek Nagy:
On Languages Generated by Signed Grammars. NCMA 2023: 28-37 - [c88]Benedek Nagy:
State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters. AFL 2023: 170-184 - [e4]Benedek Nagy:
Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings. Lecture Notes in Computer Science 14151, Springer 2023, ISBN 978-3-031-40246-3 [contents] - [e3]Benedek Nagy, Rudolf Freund:
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2023, Famagusta, North Cyprus, 18th-19th September, 2023. EPTCS 388, 2023 [contents] - 2022
- [j69]Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy:
A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model. Acta Informatica 59(5): 557-584 (2022) - [j68]Laith Alzboon, Benedek Nagy:
A Comparison of Various Extensions of Strong Truthteller and Strong Liar Puzzles (Mutes and Crazies). Axioms 11(7): 322 (2022) - [j67]Benedek Nagy:
Operational union-complexity. Inf. Comput. 284: 104692 (2022) - [j66]Benedek Nagy, Shaghayegh Parchami:
$5'\rightarrow 3'$ Watson-Crick automata languages-without sensing parameter. Nat. Comput. 21(4): 679-691 (2022) - [j65]Benedek Nagy, Mohammadreza Saadat:
Digital geometry on a cubic stair-case mesh. Pattern Recognit. Lett. 164: 140-147 (2022) - [j64]Aydin Avkan, Benedek Nagy, Müge Saadetoglu:
A comparison of digitized rotations of neighborhood motion maps of closest neighbors on 2D regular grids. Signal Image Video Process. 16(2): 505-513 (2022) - [c87]Benedek Nagy:
Union-Complexities of Kleene Plus Operation. DCFS 2022: 197-211 - [c86]Aydin Avkan, Benedek Nagy, Müge Saadetoglu:
A Comparison of 2D Regular Grids based on Digital Continuity of Rotations. ISAIM 2022 - [c85]Benedek Nagy:
Non-traditional 2D Grids in Combinatorial Imaging - Advances and Challenges. IWCIA 2022: 3-27 - [c84]Benedek Nagy:
From Finite Automata to Fractal Automata - The Power of Recursion. MCU 2022: 109-125 - [c83]Benedek Nagy:
Quasi-deterministic 5' -> 3' Watson-Crick Automata. NCMA 2022: 160-176 - 2021
- [j63]Benedek Nagy, Shaghayegh Parchami:
On deterministic sensing $5'\rightarrow 3'$ Watson-Crick finite automata: a full hierarchy in 2detLIN. Acta Informatica 58(3): 153-175 (2021) - [j62]Khaled H. Abuhmaidan, Monther Aldwairi, Benedek Nagy:
Vector Arithmetic in the Triangular Grid. Entropy 23(3): 373 (2021) - [j61]Benedek Nagy, Sándor Vályi:
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines. Fundam. Informaticae 181(2-3): 213-238 (2021) - [j60]Benedek Nagy:
Union-Freeness Revisited - Between Deterministic and Nondeterministic Union-Free Languages. Int. J. Found. Comput. Sci. 32(5): 551-573 (2021) - [j59]Benedek Nagy, Zita Kovács:
On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers. RAIRO Theor. Informatics Appl. 55: 1-18 (2021) - [j58]Benedek Nagy:
State-deterministic $5'\rightarrow 3'$ Watson-Crick automata. Nat. Comput. 20(4): 725-737 (2021) - [j57]Gergely Kovács, Benedek Nagy, Neset Deniz Turgay:
Distance on the Cairo pattern. Pattern Recognit. Lett. 145: 141-146 (2021) - [j56]Gergely Kovács, Benedek Nagy, Béla Vizvári:
Weighted distances on the truncated hexagonal grid. Pattern Recognit. Lett. 152: 26-33 (2021) - [c82]Mohammadreza Saadat, Benedek Nagy:
Digital Geometry on the Dual of Some Semi-regular Tessellations. DGMM 2021: 283-295 - [c81]Mohammadreza Saadat, Benedek Nagy:
Generating Patterns on the Triangular Grid by Cellular Automata including Alternating Use of Two Rules. ISPA 2021: 253-258 - 2020
- [j55]Aydin Avkan, Benedek Nagy, Müge Saadetoglu:
Digitized rotations of 12 neighbors on the triangular grid. Ann. Math. Artif. Intell. 88(8): 833-857 (2020) - [j54]Gergely Kovács, Benedek Nagy, Béla Vizvári:
On disks of the triangular grid: An application of optimization theory in discrete geometry. Discret. Appl. Math. 282: 136-151 (2020) - [j53]Benedek Nagy, Tibor Lukic:
Binary tomography on the isometric tessellation involving pixel shape orientation. IET Image Process. 14(1): 25-30 (2020) - [j52]Benedek Nagy:
On the Membership Problem of Permutation Grammars - A Direct Proof of NP-Completeness. Int. J. Found. Comput. Sci. 31(4): 515-525 (2020) - [j51]Benedek Nagy:
5′→3′ Watson-Crick pushdown automata. Inf. Sci. 537: 452-466 (2020) - [j50]Benedek Nagy, Friedrich Otto:
Linear automata with translucent letters and linear context-free trace languages. RAIRO Theor. Informatics Appl. 54: 3 (2020) - [j49]Mohsen Abdalla, Benedek Nagy:
Mathematical Morphology on the Triangular Grid: The Strict Approach. SIAM J. Imaging Sci. 13(3): 1367-1385 (2020)
2010 – 2019
- 2019
- [j48]Benedek Nagy, Raed Basbous, Tibor Tajti:
Lazy evaluations in Łukasiewicz type fuzzy logic. Fuzzy Sets Syst. 376: 127-151 (2019) - [j47]Gergely Kovács, Benedek Nagy, Béla Vizvári:
Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach. J. Comb. Optim. 38(3): 867-886 (2019) - [j46]Benedek Nagy, Khaled H. Abuhmaidan:
A Continuous Coordinate System for the Plane by Triangular Symmetry. Symmetry 11(2): 191 (2019) - [c80]Benedek Nagy:
Union-Freeness, Deterministic Union-Freeness and Union-Complexity. DCFS 2019: 46-56 - [c79]Benedek Nagy, Robin Strand, Nicolas Normand:
Distance Transform Based on Weight Sequences. DGCI 2019: 62-74 - [c78]Aydin Avkan, Benedek Nagy, Müge Saadetoglu:
On the Angles of Change of the Neighborhood Motion Maps on the Triangular Grid. ISPA 2019: 76-81 - [c77]Benedek Nagy, Zita Kovács:
On simple 5' → 3' sensing Watson-Crick finite-state transducers. NCMA 2019: 155-170 - [c76]Benedek Nagy, Friedrich Otto:
Two-Head Finite-State Acceptors with Translucent Letters. SOFSEM 2019: 406-418 - 2018
- [j45]Mohsen Abdalla, Benedek Nagy:
Dilation and Erosion on the Triangular Tessellation: An Independent Approach. IEEE Access 6: 23108-23119 (2018) - [j44]Lidija Comic, Benedek Nagy:
A description of the diamond grid for topological and combinatorial analysis. Graph. Model. 100: 33-50 (2018) - [j43]Henning Bordihn, Benedek Nagy, György Vaszil:
Preface: Non-classical models of automata and applications VIII. RAIRO Theor. Informatics Appl. 52(2-3-4): 87-88 (2018) - [j42]Dávid Angyal, Benedek Nagy, György Vaszil:
On the Complexity of a Mildly Context-Sensitive Language Class. J. Autom. Lang. Comb. 23(1-3): 5-18 (2018) - [j41]Benedek Nagy, Robin Strand, Nicolas Normand:
Distance Functions Based on Multiple Types of Weighted Steps Combined with Neighborhood Sequences. J. Math. Imaging Vis. 60(8): 1209-1219 (2018) - [c75]Aydin Avkan, Benedek Nagy, Müge Saadetoglu:
Digitized Rotations of Closest Neighborhood on the Triangular Grid. IWCIA 2018: 53-67 - [c74]Benedek Nagy, Tibor Lukic:
Binary Tomography on Triangular Grid Involving Hexagonal Grid Approach. IWCIA 2018: 68-81 - [c73]Benedek Nagy, Sándor Vályi:
An Extension of Interval-Valued Computing Equivalent to Red-Green Turing Machines. MCU 2018: 137-152 - [c72]Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna:
A jumping 5' → 3' Watson-Crick finite automata model. NCMA 2018: 117-132 - [c71]Shaghayegh Parchami, Benedek Nagy:
Deterministic Sensing 5'\rightarrow 3' 5 ′ → 3 ′ Watson-Crick Automata Without Sensing Parameter. UCNC 2018: 173-187 - [i3]Mousumi Dutt, Arindam Biswas, Benedek Nagy:
Counting of Shortest Paths in Cubic Grid. CoRR abs/1803.04190 (2018) - 2017
- [j40]Benedek Nagy, Elisa Valentina Moisi:
Memetic algorithms for reconstruction of binary images on triangular grids with 3 and 6 projections. Appl. Soft Comput. 52: 549-565 (2017) - [j39]Benedek Nagy:
Application of neighborhood sequences in communication of hexagonal networks. Discret. Appl. Math. 216: 424-440 (2017) - [j38]Benedek Nagy, Sándor Vályi:
A Shift-free Characterization of NP within Interval-valued Computing. Fundam. Informaticae 155(1-2): 187-207 (2017) - [j37]Jérôme Durand-Lose, Jarkko Kari, Benedek Nagy:
Preface / Editorial. Fundam. Informaticae 155(1-2): v-vii (2017) - [j36]Gergely Kovács, Benedek Nagy, Béla Vizvári:
Weighted Distances and Digital Disks on the Khalimsky Grid - Disks with Holes and Islands. J. Math. Imaging Vis. 59(1): 2-22 (2017) - [c70]Gergely Kovács, Benedek Nagy, Béla Vizvári:
Weighted Distances on the Trihexagonal Grid. DGCI 2017: 82-93 - [c69]Gergely Kovács, Benedek Nagy, Béla Vizvári:
An Integer Programming Approach to Characterize Digital Disks on the Triangular Grid. DGCI 2017: 94-106 - [c68]Benedek Nagy, Arif A. Akkeles:
Trajectories and Traces on Non-traditional Regular Tessellations of the Plane. IWCIA 2017: 16-29 - [c67]Hamid Mir Mohammad Sadeghi, Benedek Nagy:
On the Chamfer Polygons on the Triangular Grid. IWCIA 2017: 53-65 - [c66]Dávid Angyal, Benedek Nagy:
An extension of the LR parsing algorithm for two-head pushdown automata. NCMA 2017: 71-86 - [c65]Benedek Nagy, Shaghayegh Parchami, Hamid Mir Mohammad Sadeghi:
A New Sensing 5'->3' Watson-Crick Automata Concept. AFL 2017: 195-204 - 2016
- [j35]Lidija Comic, Benedek Nagy:
A combinatorial coordinate system for the body-centered cubic grid. Graph. Model. 87: 11-22 (2016) - [j34]László Hegedüs, Benedek Nagy:
On periodic properties of circular words. Discret. Math. 339(3): 1189-1197 (2016) - [j33]Benedek Nagy, Tibor Lukic:
Dense Projection Tomography on the Triangular Tiling. Fundam. Informaticae 145(2): 125-141 (2016) - [j32]Lidija Comic, Benedek Nagy:
A topological 4-coordinate system for the face centered cubic grid. Pattern Recognit. Lett. 83: 67-74 (2016) - [c64]Mohsen Abdalla, Benedek Nagy:
Concepts of Binary Morphological Operations Dilation and Erosion on the Triangular Grid. CompIMAGE 2016: 89-104 - [c63]Benedek Nagy:
Number of Words Characterizing Digital Balls on the Triangular Tiling. DGCI 2016: 31-44 - [c62]Gergely Kovács, Benedek Nagy, Béla Vizvári:
On Weighted Distances on the Khalimsky Grid. DGCI 2016: 372-384 - [c61]Benedek Nagy, Hamid Mir Mohammad Sadeghi:
Digital Disks by Weighted Distances in the Triangular Grid. DGCI 2016: 385-397 - [c60]Raed Basbous, Tibor Tajti, Benedek Nagy:
Fast evaluations in product logic various pruning techniques. FUZZ-IEEE 2016: 140-147 - [e2]Henning Bordihn, Rudolf Freund, Benedek Nagy, György Vaszil:
Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings. books@ocg.at 321, Österreichische Computer Gesellschaft 2016, ISBN 978-3-903035-10-2 [contents] - 2015
- [j31]Benedek Nagy:
Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids. Ann. Math. Artif. Intell. 75(1-2): 117-134 (2015) - [c59]Lidija Comic, Benedek Nagy:
A Combinatorial 4-Coordinate System for the Diamond Grid. ISMM 2015: 585-596 - [c58]Hamzeh Mujahed, Benedek Nagy:
Wiener Index on Lines of Unit Cells of the Body-Centered Cubic Grid. ISMM 2015: 597-606 - [c57]Lidija Comic, Benedek Nagy:
A combinatorial 3-coordinate system for the face centered cubic grid. ISPA 2015: 298-303 - [c56]Gergely T. Balint, Benedek Nagy:
Finiteness of chain-code picture languages on the triangular grid. ISPA 2015: 310-315 - [c55]Mousumi Dutt, Arindam Biswas, Benedek Nagy:
Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods. IWCIA 2015: 115-124 - [c54]Benedek Nagy, Sándor Vályi:
A Characterization of NP Within Interval-Valued Computing. MCU 2015: 164-179 - [c53]Dávid Angyal, Benedek Nagy:
On language families generated by controlled grammars. NCMA 2015: 59-72 - [c52]Benedek Nagy:
A family of two-head pushdown automata. NCMA 2015: 177-191 - [c51]Elisa Valentina Moisi, Tibor Lukic, Benedek Nagy, Vladimir-Ioan Cretu:
Comparing memetic and simulated annealing approaches for discrete tomography on the triangular grid. SACI 2015: 523-528 - [e1]Jérôme Durand-Lose, Benedek Nagy:
Machines, Computations, and Universality - 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings. Lecture Notes in Computer Science 9288, Springer 2015, ISBN 978-3-319-23110-5 [contents] - 2014
- [j30]Tibor Lukic, Benedek Nagy:
Deterministic discrete tomography reconstruction by energy minimization method on the triangular grid. Pattern Recognit. Lett. 49: 11-16 (2014) - [j29]Benedek Nagy, László Kovács:
Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory. Trans. Comput. Collect. Intell. 17: 107-127 (2014) - [c50]Raed Basbous, Benedek Nagy:
Generalized game trees and their evaluation. CogInfoCom 2014: 55-60 - [c49]Benedek Nagy:
Graphical Representations of Context-Free Languages. Diagrams 2014: 48-50 - [c48]Beáta Bojda, Katalin Bubnó, Benedek Nagy, Viktor Takács:
A Graphical Representation of Boolean Logic. Diagrams 2014: 228-230 - [c47]Benedek Nagy, Elisa Valentina Moisi:
Binary Tomography on the Triangular Grid with 3 Alternative Directions - A Genetic Approach. ICPR 2014: 1079-1084 - [c46]Benedek Nagy:
Weighted Distances on a Triangular Grid. IWCIA 2014: 37-50 - [c45]Beáta Bojda, Katalin Bubnó, Benedek Nagy, Viktor Takács:
Visualization and Efficiency in Teaching Mathematics. SOCO-CISIS-ICEUTE 2014: 555-564 - [c44]Gemma Bel Enguix, Benedek Nagy:
Modeling Syntactic Complexity with P Systems: A Preview. UCNC 2014: 54-66 - [c43]László Hegedüs, Benedek Nagy:
Representations of Circular Words. AFL 2014: 261-270 - 2013
- [j28]Benedek Nagy, Friedrich Otto:
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Acta Informatica 50(4): 229-255 (2013) - [j27]Benedek Nagy, Friedrich Otto:
Globally deterministic CD-systems of stateless R-automata with window size 1. Int. J. Comput. Math. 90(6): 1254-1277 (2013) - [j26]Benedek Nagy, Krisztina Barczi:
Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary. Int. J. Comput. Math. 90(8): 1629-1652 (2013) - [j25]Benedek Nagy:
On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languages. J. Log. Comput. 23(4): 855-872 (2013) - [c42]Benedek Nagy, László Kovács:
Linguistic Applications of Finite Automata with Translucent Letters. ICAART (1) 2013: 461-469 - [c41]Benedek Nagy, Elisa Valentina Moisi, Vladimir-Ioan Cretu:
Discrete tomography on the triangular grid based on Ryser's results. ISPA 2013: 801-806 - [c40]Benedek Nagy, Robin Strand, Nicolas Normand:
A Weight Sequence Distance Function. ISMM 2013: 292-301 - [c39]Elisa Valentina Moisi, Benedek Nagy, Vladimir-Ioan Cretu:
Maximum flow minimum cost algorithm for reconstruction of images represented on the triangular grid. SACI 2013: 35-40 - [c38]László Hegedüs, Benedek Nagy:
On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata - (Extended Abstract). UCNC 2013: 257-258 - 2012
- [j24]Benedek Nagy, Friedrich Otto:
On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78(3): 780-806 (2012) - [j23]László Hegedüs, Benedek Nagy, Ömer Egecioglu:
Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case. Nat. Comput. 11(3): 361-368 (2012) - [c37]Veronika Halász, László Hegedüs, István Hornyák, Benedek Nagy:
Solving Application Oriented Graph Theoretical Problems with DNA Computing. BIC-TA (1) 2012: 75-85 - [c36]Galina Jirásková, Benedek Nagy:
On Union-Free and Deterministic Union-Free Languages. IFIP TCS 2012: 179-192 - [c35]Benedek Nagy:
Cellular Topology on the Triangular Grid. IWCIA 2012: 143-153 - [c34]Tibor Lukic, Benedek Nagy:
Energy-Minimization Based Discrete Tomography Reconstruction Method for Images on Triangular Grid. IWCIA 2012: 274-284 - [c33]Benedek Nagy:
On Efficient Algorithms for SAT. Int. Conf. on Membrane Computing 2012: 295-310 - [c32]Elisa Valentina Moisi, Vladimir-Ioan Cretu, Benedek Nagy:
Reconstruction of Binary Images Represented on Equilateral Triangular Grid Using Evolutionary Algorithms. SOFA 2012: 561-571 - [c31]Benedek Nagy, Sándor Vályi:
Computing discrete logarithm by interval-valued paradigm. DCM 2012: 76-86 - 2011
- [j22]Ömer Egecioglu, László Hegedüs, Benedek Nagy:
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. Fundam. Informaticae 110(1-4): 111-123 (2011) - [j21]Benedek Nagy, Friedrich Otto:
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO Theor. Informatics Appl. 45(4): 413-448 (2011) - [j20]Benedek Nagy:
On CD-Systems of Stateless Deterministic R(2)-Automata. J. Autom. Lang. Comb. 16(2-4): 195-213 (2011) - [j19]Robin Strand, Benedek Nagy, Gunilla Borgefors:
Digital distance functions on three-dimensional grids. Theor. Comput. Sci. 412(15): 1350-1363 (2011) - [j18]Benedek Nagy, Robin Strand:
Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid. Theor. Comput. Sci. 412(15): 1364-1377 (2011) - [c30]Benedek Nagy, Friedrich Otto:
Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata. AFL 2011: 328-342 - [c29]Robin Strand, Benedek Nagy:
A weighted neighbourhood sequence distance function with three local steps. ISPA 2011: 564-568 - [c28]Elisa Valentina Moisi, Benedek Nagy:
Discrete tomography on the triangular grid: a memetic approach. ISPA 2011: 579-584 - [c27]Benedek Nagy, László Hegedüs, Ömer Egecioglu:
Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata. IWANN (1) 2011: 465-472 - [c26]Benedek Nagy, Krisztina Barczi:
Isoperimetrically Optimal Polygons in the Triangular Grid. IWCIA 2011: 194-207 - [c25]Benedek Nagy, Friedrich Otto:
Globally Deterministic CD-Systems of Stateless R(1)-Automata. LATA 2011: 390-401 - [c24]Benedek Nagy, Friedrich Otto, Marcel Vollweiler:
Pushdown Automata with Translucent Pushdown Symbols. NCMA 2011: 193-208 - [c23]Benedek Nagy, Friedrich Otto:
An Automata-Theoretical Characterization of Context-Free Trace Languages. SOFSEM 2011: 406-417 - 2010
- [j17]Peter Leupold, Benedek Nagy:
5' -> 3' Watson-Crick AutomataWith Several Runs. Fundam. Informaticae 104(1-2): 71-91 (2010) - [c22]Ömer Egecioglu, László Hegedüs, Benedek Nagy:
Stateless multicounter 5′ → 3′ Watson-Crick automata. BIC-TA 2010: 1599-1606 - [c21]Benedek Nagy, Friedrich Otto:
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. LATA 2010: 463-474 - [c20]Benedek Nagy:
An Automata-Theoretic Characterization of the Chomsky-Hierarchy. TAMC 2010: 361-372 - [i2]János Farkas, Szabolcs Baják, Benedek Nagy:
Approximating the Euclidean circle in the square grid using neighbourhood sequences. CoRR abs/1006.3404 (2010) - [i1]Géza Horváth, Benedek Nagy:
Pumping lemmas for linear and nonlinear context-free languages. CoRR abs/1012.0023 (2010)
2000 – 2009
- 2009
- [j16]Robin Strand, Benedek Nagy:
Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids. Discret. Appl. Math. 157(16): 3386-3400 (2009) - [j15]Benedek Nagy, Robin Strand:
Neighborhood sequences in the diamond grid: Algorithms with two and three neighbors. Int. J. Imaging Syst. Technol. 19(2): 146-157 (2009) - [j14]Benedek Nagy:
Languages Generated by Context-Free Grammars Extended by Type AB → BA Rules. J. Autom. Lang. Comb. 14(2): 175-186 (2009) - [c19]Benedek Nagy:
Permutation Languages in Formal Linguistics. IWANN (1) 2009: 504-511 - [c18]Benedek Nagy, Robin Strand:
Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids. IWCIA 2009: 96-108 - [c17]Benedek Nagy, Robin Strand:
Neighborhood Sequences in the Diamond Grid - Algorithms with Four Neighbors. IWCIA 2009: 109-121 - [c16]Peter Leupold, Benedek Nagy:
5' → 3' Watson-Crick Automata with Several Runs. NCMA 2009: 167-180 - 2008
- [j13]Benedek Nagy:
Distance with generalized neighbourhood sequences in n D and infinity D. Discret. Appl. Math. 156(12): 2344-2351 (2008) - [j12]Benedek Nagy, Robin Strand:
Non-Traditional Grids Embedded in Zn. Int. J. Shape Model. 14(2): 209-228 (2008) - [j11]Szilárd Zsolt Fazekas, Benedek Nagy:
Scattered Subword Complexity of non-Primitive Words. J. Autom. Lang. Comb. 13(3/4): 233-247 (2008) - [j10]Benedek Nagy, Sándor Vályi:
Interval-valued computations and their connection with PSPACE. Theor. Comput. Sci. 394(3): 208-222 (2008) - [c15]Robin Strand, Benedek Nagy:
Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms. DGCI 2008: 201-212 - [c14]Benedek Nagy, Robin Strand:
A Connection between Zn and Generalized Triangular Grids. ISVC (2) 2008: 1157-1166 - [c13]Robin Strand, Benedek Nagy:
Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids - Parameter Optimization. IWCIA 2008: 51-62 - [c12]Benedek Nagy, Robin Strand:
Neighborhood Sequences in the Diamond Grid. IWCIA Special Track on Applications 2008: 187-195 - 2007
- [j9]Ervin Melkó, Benedek Nagy:
Optimal strategy in games with chance nodes. Acta Cybern. 18(2): 171-192 (2007) - [j8]Robin Strand, Benedek Nagy:
Distances based on neighbourhood sequences in non-standard three-dimensional grids. Discret. Appl. Math. 155(4): 548-557 (2007) - [j7]Benedek Nagy:
Distances with neighbourhood sequences in cubic and triangular grids. Pattern Recognit. Lett. 28(1): 99-109 (2007) - [c11]Benedek Nagy:
On 5' --> 3' Sensing Watson-Crick Finite Automata. DNA 2007: 256-262 - [c10]Benedek Nagy, Sándor Vályi:
Visual Reasoning by Generalized Interval-values and Interval Temporal Logic. VLL 2007: 13-26 - 2006
- [j6]Benedek Nagy, László Szegedi:
Membrane Computing and Graphical Operating Systems. J. Univers. Comput. Sci. 12(9): 1312-1331 (2006) - [c9]Benedek Nagy:
Geometry of Neighborhood Sequences in Hexagonal Grid. DGCI 2006: 53-64 - [c8]Robin Strand, Benedek Nagy, Céline Fouard, Gunilla Borgefors:
Generating Distance Maps with Neighbourhood Sequences. DGCI 2006: 295-307 - [c7]Benedek Nagy:
Reasoning by Intervals. Diagrams 2006: 145-147 - [c6]Adrian-Horia Dediu, Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Benedek Nagy:
Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages. Developments in Language Theory 2006: 327-338 - [c5]Benedek Nagy, Robin Strand:
Approximating Euclidean Distance Using Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids. IWCIA 2006: 89-100 - 2005
- [j5]Benedek Nagy:
An algorithm to find the number of the digitizations of discs with a fixed radius. Electron. Notes Discret. Math. 20: 607-622 (2005) - [j4]Benedek Nagy:
On the language equivalence of NE star-patterns. Inf. Process. Lett. 95(3): 396-400 (2005) - [c4]Benedek Nagy:
A Comparison Among Distances Based on Neighborhood Sequences in Regular Grids. SCIA 2005: 1027-1036 - 2004
- [j3]Benedek Nagy:
The Languages of SAT and n-SAT over Finitely Many Variables are Regular. Bull. EATCS 82: 286-297 (2004) - [j2]Benedek Nagy:
Characterization of digital circles in triangular grid. Pattern Recognit. Lett. 25(11): 1231-1242 (2004) - [c3]Benedek Nagy, Gerard Allwein:
Diagrams and Non-monotonicity in Puzzles. Diagrams 2004: 82-96 - [c2]Benedek Nagy:
Calculating Distance with Neighborhood Sequences in the Hexagonal Grid. IWCIA 2004: 98-109 - 2003
- [j1]Benedek Nagy:
SW-type puzzles and their graphs. Acta Cybern. 16(1): 67-82 (2003) - [c1]András Hajdu, Benedek Nagy, Zoltán Zörgö:
Indexing and segmenting colour images using neighbourhood sequences. ICIP (1) 2003: 957-960
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
