default search action
Acta Cybernetica, Volume 12
Volume 12, Number 1, 1995
- Lila Kari, Grzegorz Rozenberg, Arto Salomaa:
Generalised DOL Trees. 1-9 - Balázs Imreh:
On Isomorphic Representation of Nondeterministic Tree Automata. 11-21 - Balázs Imreh, Magnus Steinby:
Some Remarks on Directable Automata. 23-35 - John Grant, V. S. Subrahmanian:
The Optimistic and Cautius Semantics for Inconsistent Knowledge Bases. 37-55 - Attila Kuba:
Reconstruction of Unique Binary Matrices with Prescribed Elements. 57-70 - Judit Nyéki-Gaizler, Márta Konczné-Nagy, Ákos Fóthi, Éva Harangozó:
Demonstration of a Problem-Solving Method. 71-82 - Zoltán Horváth:
Parallel Asynchronous Computation of the Values of an Assotiative Function. 83-94 - János Toczki:
Towards Computer Aided Development of Parallel Compilers Running on Transputer Architecture. 95-106
Volume 12, Number 2, 1995
- Miklós Bartha, Éva Gombás:
On Graphs with Perfect Internal Matchings. 111-124 - András Pluhár:
Remarks on the Interval Number of Graphs. 125-129 - István Babcsányi, Attila Nagy:
Right Group-Type Automata. 131-136 - Ivan Mirchev, Borislav Yurukov:
Some Properties of H-Functions. 137-143 - I. K. Rystsov:
Quasioptimal Bound for the Length of Reset Words for Regular Automata. 145-152 - Ágnes Achs, Attila Kiss:
Fuzzy Extension of Datalog. 153-166 - János Demetrovics, Vu Duc Thi:
Some Remarks On Generating Armstrong And Inferring Functional Dependencies Relation. 167-180 - Mark Levene:
A Lattice View of Functional Dependencies in Incomplete Relations. 181-207 - I. Bartalos, T. Dudás, Balázs Imreh:
On a Tour Construction Heuristic for the Asymmetric TSP. 209-216
Volume 12, Number 3, 1996
- Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
On Representing RE Languages by One-Sided Internal Contextual Languages. 217-233 - Valeria Mihalache, Arto Salomaa:
Growth Functions and Length Sets of Replicating Systems. 235-247 - Gabriel Ciobanu:
The Reflexive Domain of CPO's Ideals. 249-260 - Gábor Dányi:
On Domain and Range Tree Languages of Superlinear Deterministic Top-down Tree Transformations. 261-277 - L. Lévai, Péter P. Pálfy:
On Binary Minimal Clones. 279-294 - Ferucio Laurentiu Tiplea, Masashi Katsura, Masami Ito:
On a Normal Form of Petri Nets. 295-308 - Zoltán Blázsik, Balázs Imreh:
A Note on Connection Between PNS and Set Covering Problems. 309-312 - Rainer E. Burkard, Tibor Dudás:
Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle. 313-324
Volume 12, Number 4, 1996
- Erzsébet Csuhaj-Varjú:
Grammar Systems: Recent Results and Perspectives (Foreword). 325-330 - Jürgen Dassow, Victor Mitrana:
Fairness in Grammar Systems. 331-345 - Henning Bordihn, Erzsébet Csuhaj-Varjú:
On Competence and Completeness in CD Grammar Systems. 347-360 - Henning Fernau, Markus Holzer:
Accepting Multi-Agent Systems II. 361-379 - Gheorghe Paun:
PC Grammar Systems: Recent Results, Open Problems. 381-395 - Valeria Mihalache:
PC Grammar Systems with Separated Alphabets. 397-409 - Lucian Ilie, Arto Salomaa:
On Regular Characterizations of Languages by Grammar Systems. 411-425 - Maurice H. ter Beek:
Teams in Grammar Systems: Hybridity and Weak Rewriting. 425-444 - Rudolf Freund, Franziska Freund:
Test Tube Systems or How to Bake a DNA Cake. 445-459 - Carlos Martín-Vide:
Natural Language Understanding: a New Challenge for Grammar Systems. 461-472
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: