 | 2012 |
|---|
| 47 |       | 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) |
| 2011 |
|---|
| 46 |  | Benedek Nagy,
Friedrich Otto:
Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata.
AFL 2011: 328-342 |
| 45 | | Benedek Nagy,
László Hegedüs,
Ömer Egecioglu:
Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata.
IWANN (1) 2011: 465-472 |
| 44 | | Benedek Nagy,
Krisztina Barczi:
Isoperimetrically Optimal Polygons in the Triangular Grid.
IWCIA 2011: 194-207 |
| 43 | | Benedek Nagy,
Friedrich Otto:
Globally Deterministic CD-Systems of Stateless R(1)-Automata.
LATA 2011: 390-401 |
| 42 | | Benedek Nagy,
Friedrich Otto,
Marcel Vollweiler:
Pushdown Automata with Translucent Pushdown Symbols.
NCMA 2011: 193-208 |
| 41 | | Benedek Nagy,
Friedrich Otto:
An Automata-Theoretical Characterization of Context-Free Trace Languages.
SOFSEM 2011: 406-417 |
| 40 | | Ö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) |
| 39 | | Robin Strand,
Benedek Nagy,
Gunilla Borgefors:
Digital distance functions on three-dimensional grids.
Theor. Comput. Sci. 412(15): 1350-1363 (2011) |
| 38 | | Benedek Nagy,
Robin Strand:
Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid.
Theor. Comput. Sci. 412(15): 1364-1377 (2011) |
| 2010 |
|---|
| 37 | | Ömer Egecioglu,
László Hegedüs,
Benedek Nagy:
Stateless multicounter 5′ → 3′ Watson-Crick automata.
BIC-TA 2010: 1599-1606 |
| 36 | | Benedek Nagy,
Friedrich Otto:
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages.
LATA 2010: 463-474 |
| 35 | | Benedek Nagy:
An Automata-Theoretic Characterization of the Chomsky-Hierarchy.
TAMC 2010: 361-372 |
| 34 | | Janos Farkas,
Szabolcs Baják,
Benedek Nagy:
Approximating the Euclidean circle in the square grid using neighbourhood sequences
CoRR abs/1006.3404: (2010) |
| 33 | | Géza Horváth,
Benedek Nagy:
Pumping lemmas for linear and nonlinear context-free languages
CoRR abs/1012.0023: (2010) |
| 32 | | Peter Leupold,
Benedek Nagy:
5' -> 3' Watson-Crick AutomataWith Several Runs.
Fundam. Inform. 104(1-2): 71-91 (2010) |
| 2009 |
|---|
| 31 | | Benedek Nagy:
Permutation Languages in Formal Linguistics.
IWANN (1) 2009: 504-511 |
| 30 | | Benedek Nagy,
Robin Strand:
Neighborhood Sequences in the Diamond Grid - Algorithms with Four Neighbors.
IWCIA 2009: 109-121 |
| 29 | | Benedek Nagy,
Robin Strand:
Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids.
IWCIA 2009: 96-108 |
| 28 | | Peter Leupold,
Benedek Nagy:
5' → 3' Watson-Crick Automata with Several Runs.
NCMA 2009: 167-180 |
| 27 | | 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) |
| 2008 |
|---|
| 26 | | Robin Strand,
Benedek Nagy:
Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms.
DGCI 2008: 201-212 |
| 25 | | Benedek Nagy,
Robin Strand:
A Connection between Zn and Generalized Triangular Grids.
ISVC (2) 2008: 1157-1166 |
| 24 | | Robin Strand,
Benedek Nagy:
Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids - Parameter Optimization.
IWCIA 2008: 51-62 |
| 23 | | Benedek Nagy:
Distance with generalized neighbourhood sequences in n D and infinity D.
Discrete Applied Mathematics 156(12): 2344-2351 (2008) |
| 22 | | Benedek Nagy,
Robin Strand:
Non-Traditional Grids Embedded in Zn.
International Journal of Shape Modeling 14(2): 209-228 (2008) |
| 21 | | Benedek Nagy,
Sándor Vályi:
Interval-valued computations and their connection with PSPACE.
Theor. Comput. Sci. 394(3): 208-222 (2008) |
| 2007 |
|---|
| 20 | | Benedek Nagy:
On 5' --> 3' Sensing Watson-Crick Finite Automata.
DNA 2007: 256-262 |
| 19 | | Benedek Nagy,
Sándor Vályi:
Visual Reasoning by Generalized Interval-values and Interval Temporal Logic.
VLL 2007: 13-26 |
| 18 | | Ervin Melkó,
Benedek Nagy:
Optimal strategy in games with chance nodes.
Acta Cybern. 18(2): 171-192 (2007) |
| 17 | | Robin Strand,
Benedek Nagy:
Distances based on neighbourhood sequences in non-standard three-dimensional grids.
Discrete Applied Mathematics 155(4): 548-557 (2007) |
| 16 | | Benedek Nagy:
Distances with neighbourhood sequences in cubic and triangular grids.
Pattern Recognition Letters 28(1): 99-109 (2007) |
| 2006 |
|---|
| 15 | | Robin Strand,
Benedek Nagy,
Céline Fouard,
Gunilla Borgefors:
Generating Distance Maps with Neighbourhood Sequences.
DGCI 2006: 295-307 |
| 14 | | Benedek Nagy:
Geometry of Neighborhood Sequences in Hexagonal Grid.
DGCI 2006: 53-64 |
| 13 | | 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 |
| 12 | | Benedek Nagy:
Reasoning by Intervals.
Diagrams 2006: 145-147 |
| 11 | | Benedek Nagy,
Robin Strand:
Approximating Euclidean Distance Using Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids.
IWCIA 2006: 89-100 |
| 10 | | Benedek Nagy,
László Szegedi:
Membrane Computing and Graphical Operating Systems.
J. UCS 12(9): 1312-1331 (2006) |
| 2005 |
|---|
| 9 | | Benedek Nagy:
A Comparison Among Distances Based on Neighborhood Sequences in Regular Grids.
SCIA 2005: 1027-1036 |
| 8 | | 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) |
| 7 | | Benedek Nagy:
On the language equivalence of NE star-patterns.
Inf. Process. Lett. 95(3): 396-400 (2005) |
| 2004 |
|---|
| 6 | | Benedek Nagy,
Gerard Allwein:
Diagrams and Non-monotonicity in Puzzles.
Diagrams 2004: 82-96 |
| 5 | | Benedek Nagy:
Calculating Distance with Neighborhood Sequences in the Hexagonal Grid.
IWCIA 2004: 98-109 |
| 4 | | Benedek Nagy:
The Languages of SAT and n-SAT over Finitely Many Variables are Regular.
Bulletin of the EATCS 82: 286-297 (2004) |
| 3 | | Benedek Nagy:
Characterization of digital circles in triangular grid.
Pattern Recognition Letters 25(11): 1231-1242 (2004) |
| 2003 |
|---|
| 2 | | András Hajdu,
Benedek Nagy,
Zoltán Zörgö:
Indexing and segmenting colour images using neighbourhood sequences.
ICIP (1) 2003: 957-960 |
| 1 | | Benedek Nagy:
SW-type puzzles and their graphs.
Acta Cybern. 16(1): 67-82 (2003) |
Data released under the ODC-BY 1.0 license — See also our legal information page