default search action
Acta Cybernetica, Volume 7
Volume 7, Number 1, 1985
- Stephen L. Bloom:
Frontiers of one-letter languages. 1-18 - Éva Gombás, Miklós Bartha:
A multi-visti charaterization of absolutely noncircular attribute grammars. 19-31 - Rainer Parchmann, Jürgen Duske, Johann Specht:
Indexed LL(k) Grammars. 33-53 - Ferenc Gécseg:
On νi-products of commutative automata. 55-59 - Balázs Imreh:
On finite definite automata. 61-65 - Masami Ito, Jürgen Duske:
On involutorial automata and involutorial events. 67-79 - Tamás Legendi, Endre Katona:
A solution of the early bird problem in an n-dimensional cellular space. 81-87 - E. Simon:
Language extension in the HLP/SZ system. 89-97 - Ho Thuan, Le Van Bao:
Some results about keys of relational schemas. 99-113 - János Sztrik:
A queueing model for multiprogrammed computer systems with different I/O times. 127-135 - László Szabó:
Characterization of clones acting bicentrally and containing a primitive group. 137-145
Volume 7, Number 2, 1985
- Zoltán Ésik:
On the weak equivalence of Elgot's flow-chart schemata. 147-154 - Éva Gombás, Miklós Bartha:
Atomic characterizations of uniform multi-pass attribute grammars. 155-172 - Z. Zachar:
On the equivalence of the frontier-to-root tree transducers I. 173-182 - Z. Zachar:
On the equivalence of the frontier-to-root tree transducers II. 183-193 - Ketty Peeva:
Systems of linear equations over a bounded chain. 195-202 - Ferenc Gécseg:
Metric representations by νi-products. 203-209 - Péter Ecsedi-Tóth:
A partial solution of the finite spectrum problem. 211-215 - Imre Pávó:
The analysis of signal flow graph containing sampled-data elements. 217-223 - Ernesto Burattini, G. Marra, A. Sforza:
Network design problem: structure of solutions and dominance relations. 225-239
Volume 7, Number 3, 1986
- János Csirik, E. Máté:
The probabilistic behaviour of the NFD Bin Packing algorithm. 241-245 - Do Long Van:
Langages écrits par un code infinitaire. Théorème du défaut. 247-257 - András Ádám:
On the congruences of finite autonomous Moore automata. 259-279 - Masashi Katsura:
On complexity of finite moore automata. 281-292 - Zoltán Ésik:
Varieties and general products of top-down algebras. 293-298 - Zoltán Ésik, J. Virágh:
On products of automata with identity. 299-311 - József Dombi:
Properties of the fuzzy connectives in the light of the general representations theorem. 313-321 - A. M. Iványi, A. N. Sotnikow:
On the optimization of library information retrieval systems. 323-328 - János Sztrik:
A probability model for priority processor-shared multiprogrammed computer systems. 329-340 - Andras Szép:
Iterative method for solving M/G/1//N-type loops with priority queues. 341-354
Volume 7, Number 4, 1986
- Stephen L. Bloom:
The alternation number and a dot hierarchy of regular sets. 355-358 - Vu Duc Thi:
Minimal keys and antikeys. 361-371 - J. Pecht:
On the index of concavity of neighbourhood templates. 373-376 - A. Varga:
Optimization of multi valued logical functions based on evaluation graphs. 377-403 - Konrad Engel, Hans-Dietrich O. F. Gronau:
An Erdős-Ko-Rado Type Theorem II. 405-411 - R. Alvarez Gil:
Giving mathematical semantics of nondeterministic and parallel programming structures by means of attribute grammars. 413-423 - E. Simon:
A new programming methodology using attribute grammars. 425-436 - Svyatoslav Sergeevich Lavrov:
Problem solving based on knowledge representation and program synthesis. 437-441 - Sándor Vágvölgyi:
On compositions of root-to-frontier tree transformations. 443-480
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-12-19 22:14 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: