Journals in DBLP

Acta Cybern.
1981, volume: 5, number:

1. Zoltán Ésik
   Decidability results concerning tree transducers I. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:1-20 [Journal]
   
2. Balázs Imreh
   On isomorphic representations of commutative automata with respect to alpha_i-products. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:21-32 [Journal]
   
3. J. Virágh
   Deterministic ascending tree automata I. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:33-42 [Journal]
   
4. László Csirmaz
   Iterated grammars. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:43-47 [Journal]
   
5. Gábor Czédli
   d-dependency structures in the relational model of data. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:49-57 [Journal]
   
6. L. Varga
   Synthesis of abstract algorithms. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:59-76 [Journal]
   
7. R. I. Phelfs, L. C. Thomas
   On optimal performance in self-organizing paging algorithms. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:77-85 [Journal]
   
8. J. Tankó
   Dominant schedules of a steady job-flow pair. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:87-115 [Journal]
   
9. András Ádám
   On the complexity of codes and pre-codes assigned to finite Moore automata. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1981, v:5, n:, pp:117-133 [Journal]
   
10. Gheorghe Grigoras
    On the isomorphism-complete problems and polynomial time isomorphism. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:135-142 [Journal]
    
11. Zoltán Ésik, Balázs Imreh
    Remarks on finite commutative automat. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:143-146 [Journal]
    
12. Gábor Horváth
    Functor state machines. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:147-172 [Journal]
    
13. Tamás Legendi, Endre Katona
    A 5 state solution of the early bird problem in a one dimensional cellular space. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:173-179 [Journal]
    
14. László Csirmaz
    On the completeness of proving partial correctness. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:181-190 [Journal]
    
15. Józef Drewniak
    Axiomatic systems in fuzzy algebra. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:191-206 [Journal]
    
16. T. Tankó
    Priority schedules of a steady job-flow pair. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:207-250 [Journal]
    
17. Zoltán Ésik, Balázs Imreh
    Subdirectly irreducible commutative automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:251-260 [Journal]
    
18. Zoltán Fülöp
    On attributed tree transducers. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:261-279 [Journal]
    
19. Balázs Imreh
    On finite nilpotent automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:281-293 [Journal]
    
20. János Demetrovics, Gy. Gyepesi
    On the functional dependency and some generalizations of it. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1981, v:5, n:, pp:295-305 [Journal]