Journals in DBLP

Acta Cybern.
2001, volume: 15, number: 1

1. András Ádám
   On some algebraic properties of automata. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:1-8 [Journal]
   
2. Jürgen Dassow, Gheorghe Paun
   P Systems with Communication Based on Concentration. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:9-24 [Journal]
   
3. Pál Dömösi, Satoshi Okawa
   A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:25-32 [Journal]
   
4. Ferenc Gécseg, Balázs Imreh
   On isomorphic representations of generalized definite automata. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:33-44 [Journal]
   
5. Andrei Kelarev, Olga Sokratova
   Languages Recognized by a Class of Finite Automata. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:45-52 [Journal]
   
6. Shankara Narayanan Krishna, Raghavan Rama, Kamala Krithivasan
   P Systems with Picture Objects. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:53-74 [Journal]
   
7. Angelo Monti, Adriano Peron
   Logical definability of Y-tree and trellis systolic omega-languages. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:75-100 [Journal]
   
8. Attila Tanács, Gábor Czédli, Kálmán Palágyi, Attila Kuba
   Affine matching of two sets of points in arbitrary dimensions. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:101-106 [Journal]
   
9. Gerhard J. Woeginger, Jiri Sgall
   The complexity of coloring graphs without long induced paths. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 2001, v:15, n:1, pp:107-0 [Journal]