default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Cybernetica, Volume 6
Volume 6, Number 1, 1983
- L. Varga:
On the verification of abstract data types. 7-12 - L. Borzemski:
Data structures and storage structures in scientific data base for multistage experiment. 13-21 - Hans Kleine Büning:
The early bird problem is unsolvable in a one-dimensional cellular space with 4 states. 23-31 - Josef Pecht:
On the real-time recognition of formal languages in cellular automata. 33-53 - Ipke Wachsmuth:
Locally synchronous cellular automata. 55-78 - Pál Dömösi:
On homomorphically αi-complete systems of automata. 85-88 - János Sztrik:
Probability model for non-homogeneous multiprogramming computer system. 93-101 - Th. Fischer:
Das Prinzip der maximalen Entropie und seine Anwendung in der Codierungs- und Suchtheorie. 103-110 - Ana Pasztor:
Epis of some categories of Z-continuous partial algebras. 111-123
Volume 6, Number 2, 1983
- Miklós Bartha:
Linear deterministic attributed transformations. 125-147 - Pál Dömösi, Balázs Imreh:
On νi-products of automata. 149-162 - Zoltán Fülöp:
Decomposition results concerning K-visit attributed tree transducers. 163-171 - Ferenc Gécseg:
On a representation of deterministic uniform root-to-frontier tree transformations. 173-180 - Masami Ito, Jürgen Duske:
On cofinal and definite automata. 181-189 - József Dombi, Z. Vas:
Basic theoretical treatment of fuzzy connectives. 191-201 - M. Arató:
Run length control in simulations and performance evaluation and elementary Gaussian processes. 203-212 - Péter Ecsedi-Tóth:
A theory of finite functions, Part I. On finite trees associated to certain finite functions. 213-225
Volume 6, Number 3, 1983
- B. Csákány:
All minimal clones on the three-element set. 227-238 - Jakob Gonczarowski, H. C. M. Kleijn, Grzegorz Rozenberg:
Grammatical constructions in selective substitution grammars. 239-269 - György Turán:
On the complexity of graph grammars. 271-280 - Zoltán Ésik, Ferenc Gécseg:
General products and equational classes of automata. 281-284 - J. Virágh:
Deterministic ascending tree automata II. 291-301 - Zoltán Ésik:
Decidability results concerning tree transducers II. 303-314 - Tibor Gyimóthy, Endre Simon, Árpád Makay:
An implementation of the HLP. 315-327
Volume 6, Number 4, 1984
- András Ádám:
On certain partitions of finite directed graphs and of finite automata. 331-346 - Miklós Bartha:
On injective attributed characterization of 2-way deterministic finite state transducers. 347-353 - Jürgen Dassow:
On some extensions of Russian parallel context free grammars. 355-360 - Cs. Puskás:
A new method for the analysis and synthesis of finite Mealy-automata. 361-369 - Helmut Jürgensen:
Komplexität von Erzeugen in Algebren. 371-379 - László Szabó:
On the lattice of clones acting bicentrally. 381-388 - Reinhard Klette:
Analysis of data flow for SIMD systems. 389-423 - Péter Ecsedi-Tóth, L. Turi:
On the number of zero order interpolants. 425-436
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
