Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Benedek Nagy
2010 – today
- 2013
[j25]Benedek Nagy, Friedrich Otto: Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Acta Inf. 50(4): 229-255 (2013)- [c34]Benedek Nagy, Robin Strand, Nicolas Normand: A Weight Sequence Distance Function. ISMM 2013: 292-301
- [c33]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. Natural Computing 11(3): 361-368 (2012)
- [c32]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
- [c31]Galina Jirásková, Benedek Nagy: On Union-Free and Deterministic Union-Free Languages. IFIP TCS 2012: 179-192
- [c30]
- [c29]Tibor Lukic, Benedek Nagy: Energy-Minimization Based Discrete Tomography Reconstruction Method for Images on Triangular Grid. IWCIA 2012: 274-284
- [c28]
- 2011
- [j22]Ömer Egecioglu, László Hegedüs, Benedek Nagy: Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. Fundam. Inform. 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. Inf. and Applic. 45(4): 413-448 (2011)
- [j20]Benedek Nagy: On CD-Systems of Stateless Deterministic R(2)-Automata. Journal of Automata, Languages and Combinatorics 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)
- [c27]Benedek Nagy, Friedrich Otto: Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata. AFL 2011: 328-342
- [c26]Benedek Nagy, László Hegedüs, Ömer Egecioglu: Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata. IWANN (1) 2011: 465-472
- [c25]Benedek Nagy, Krisztina Barczi: Isoperimetrically Optimal Polygons in the Triangular Grid. IWCIA 2011: 194-207
- [c24]Benedek Nagy, Friedrich Otto: Globally Deterministic CD-Systems of Stateless R(1)-Automata. LATA 2011: 390-401
- [c23]Benedek Nagy, Friedrich Otto, Marcel Vollweiler: Pushdown Automata with Translucent Pushdown Symbols. NCMA 2011: 193-208
- [c22]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. Inform. 104(1-2): 71-91 (2010)
- [c21]Ömer Egecioglu, László Hegedüs, Benedek Nagy: Stateless multicounter 5′ → 3′ Watson-Crick automata. BIC-TA 2010: 1599-1606
- [c20]Benedek Nagy, Friedrich Otto: CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. LATA 2010: 463-474
- [c19]
- [i2]Janos 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. Discrete Applied Mathematics 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 Systems and Technology 19(2): 146-157 (2009)
- [j14]Benedek Nagy: Languages Generated by Context-Free Grammars Extended by Type AB -> BA Rules. Journal of Automata, Languages and Combinatorics 14(2): 175-186 (2009)
- [c18]
- [c17]Benedek Nagy, Robin Strand: Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids. IWCIA 2009: 96-108
- [c16]Benedek Nagy, Robin Strand: Neighborhood Sequences in the Diamond Grid - Algorithms with Four Neighbors. IWCIA 2009: 109-121
- [c15]
- 2008
- [j13]Benedek Nagy: Distance with generalized neighbourhood sequences in n D and infinity D. Discrete Applied Mathematics 156(12): 2344-2351 (2008)
- [j12]Benedek Nagy, Robin Strand: Non-Traditional Grids Embedded in Zn. International Journal of Shape Modeling 14(2): 209-228 (2008)
- [j11]Szilárd Zsolt Fazekas, Benedek Nagy: Scattered Subword Complexity of non-Primitive Words. Journal of Automata, Languages and Combinatorics 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)
- [c14]Robin Strand, Benedek Nagy: Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms. DGCI 2008: 201-212
- [c13]Benedek Nagy, Robin Strand: A Connection between Zn and Generalized Triangular Grids. ISVC (2) 2008: 1157-1166
- [c12]Robin Strand, Benedek Nagy: Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids - Parameter Optimization. IWCIA 2008: 51-62
- 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. Discrete Applied Mathematics 155(4): 548-557 (2007)
- [j7]Benedek Nagy: Distances with neighbourhood sequences in cubic and triangular grids. Pattern Recognition Letters 28(1): 99-109 (2007)
- [c11]
- [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. UCS 12(9): 1312-1331 (2006)
- [c9]
- [c8]Robin Strand, Benedek Nagy, Céline Fouard, Gunilla Borgefors: Generating Distance Maps with Neighbourhood Sequences. DGCI 2006: 295-307
- [c7]
- [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. Electronic Notes in Discrete Mathematics 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. Bulletin of the EATCS 82: 286-297 (2004)
- [j2]Benedek Nagy: Characterization of digital circles in triangular grid. Pattern Recognition Letters 25(11): 1231-1242 (2004)
- [c3]
- [c2]Benedek Nagy: Calculating Distance with Neighborhood Sequences in the Hexagonal Grid. IWCIA 2004: 98-109
- 2003
- [j1]
- [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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-07 21:37 CEST by the dblp team