 | 2009 |
|---|
| 26 |       | Benedek Nagy:
Permutation Languages in Formal Linguistics.
IWANN (1) 2009: 504-511 |
| 2008 |
|---|
| 25 | | Robin Strand,
Benedek Nagy:
Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms.
DGCI 2008: 201-212 |
| 24 | | Benedek Nagy,
Robin Strand:
A Connection between Zn and Generalized Triangular Grids.
ISVC (2) 2008: 1157-1166 |
| 23 | | Robin Strand,
Benedek Nagy:
Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids - Parameter Optimization.
IWCIA 2008: 51-62 |
| 22 | | Benedek Nagy:
Distance with generalized neighbourhood sequences in n D and infinity D.
Discrete Applied Mathematics 156(12): 2344-2351 (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) |
