• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 32 matches

• 1984
• 
  András Ádám:
  On certain partitions of finite directed graphs and of finite automata. Acta Cybern. 6(4): 331-346 (1984)
• 
  Miklós Bartha:
  On injective attributed characterization of 2-way deterministic finite state transducers. Acta Cybern. 6(4): 347-353 (1984)
• 
  Jürgen Dassow:
  On some extensions of Russian parallel context free grammars. Acta Cybern. 6(4): 355-360 (1984)
• 
  Péter Ecsedi-Tóth, L. Turi:
  On the number of zero order interpolants. Acta Cybern. 6(4): 425-436 (1984)
• 
  Helmut Jürgensen:
  Komplexität von Erzeugen in Algebren. Acta Cybern. 6(4): 371-379 (1984)
• 
  Reinhard Klette:
  Analysis of data flow for SIMD systems. Acta Cybern. 6(4): 389-423 (1984)
• 
  Cs. Puskás:
  A new method for the analysis and synthesis of finite Mealy-automata. Acta Cybern. 6(4): 361-369 (1984)
• 
  László Szabó:
  On the lattice of clones acting bicentrally. Acta Cybern. 6(4): 381-388 (1984)
• 1983
• 
  M. Arató:
  Run length control in simulations and performance evaluation and elementary Gaussian processes. Acta Cybern. 6(2): 203-212 (1983)
• 
  Miklós Bartha:
  Linear deterministic attributed transformations. Acta Cybern. 6(2): 125-147 (1983)
• 
  L. Borzemski:
  Data structures and storage structures in scientific data base for multistage experiment. Acta Cybern. 6(1): 13-21 (1983)
• 
  Hans Kleine Büning:
  The early bird problem is unsolvable in a one-dimensional cellular space with 4 states. Acta Cybern. 6(1): 23-31 (1983)
• 
  B. Csákány:
  All minimal clones on the three-element set. Acta Cybern. 6(3): 227-238 (1983)
• 
  József Dombi, Z. Vas:
  Basic theoretical treatment of fuzzy connectives. Acta Cybern. 6(2): 191-201 (1983)
• 
  Pál Dömösi:
  On homomorphically α_i-complete systems of automata. Acta Cybern. 6(1): 85-88 (1983)
• 
  Pál Dömösi, Balázs Imreh:
  On ν_i-products of automata. Acta Cybern. 6(2): 149-162 (1983)
• 
  Péter Ecsedi-Tóth:
  A theory of finite functions, Part I. On finite trees associated to certain finite functions. Acta Cybern. 6(2): 213-225 (1983)
• 
  Zoltán Ésik:
  Decidability results concerning tree transducers II. Acta Cybern. 6(3): 303-314 (1983)
• 
  Zoltán Ésik, Ferenc Gécseg:
  General products and equational classes of automata. Acta Cybern. 6(3): 281-284 (1983)
• 
  Th. Fischer:
  Das Prinzip der maximalen Entropie und seine Anwendung in der Codierungs- und Suchtheorie. Acta Cybern. 6(1): 103-110 (1983)
• 
  Zoltán Fülöp:
  Decomposition results concerning K-visit attributed tree transducers. Acta Cybern. 6(2): 163-171 (1983)
• 
  Ferenc Gécseg:
  On a representation of deterministic uniform root-to-frontier tree transformations. Acta Cybern. 6(2): 173-180 (1983)
• 
  Jakob Gonczarowski, H. C. M. Kleijn, Grzegorz Rozenberg:
  Grammatical constructions in selective substitution grammars. Acta Cybern. 6(3): 239-269 (1983)
• 
  Tibor Gyimóthy, Endre Simon, Árpád Makay:
  An implementation of the HLP. Acta Cybern. 6(3): 315-327 (1983)
• 
  Masami Ito, Jürgen Duske:
  On cofinal and definite automata. Acta Cybern. 6(2): 181-189 (1983)
• 
  Ana Pasztor:
  Epis of some categories of Z-continuous partial algebras. Acta Cybern. 6(1): 111-123 (1983)
• 
  Josef Pecht:
  On the real-time recognition of formal languages in cellular automata. Acta Cybern. 6(1): 33-53 (1983)
• 
  János Sztrik:
  Probability model for non-homogeneous multiprogramming computer system. Acta Cybern. 6(1): 93-101 (1983)
• 
  György Turán:
  On the complexity of graph grammars. Acta Cybern. 6(3): 271-280 (1983)
• 
  L. Varga:
  On the verification of abstract data types. Acta Cybern. 6(1): 7-12 (1983)

skipping 2 more matches