Acta Cybernetica

2003

Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata
by: Zoltán Ésik, Masami Ito v. 16 i. 1 p. 1 - 28
On D0L systems with finite axiom sets
by: Juha Honkala v. 16 i. 1 p. 29 - 35
On directable nondeterministic trapped automata
by: Balázs Imreh, Csanád Imreh, Masami Ito v. 16 i. 1 p. 37 - 45
On variable sized vector packing
by: Leah Epstein v. 16 i. 1 p. 47 - 56
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
by: Leah Epstein, Lene M. Favrholdt v. 16 i. 1 p. 57 - 66
SW-type puzzles and their graphs
by: Benedek Nagy v. 16 i. 1 p. 67 - 82
Infinite limits and R-recursive functions
by: Jerzy Mycka v. 16 i. 1 p. 83 - 91
Derivation of Incremental Equations for PNF Nested Relations
by: Jixue Liu, Millist W. Vincent v. 16 i. 1 p. 93 - 131
Velocity and Distance of Neighbourhood Sequences
by: András Hajdu, Lajos Hajdu v. 16 i. 1 p. 133 - 145
Modelling a Sender-Receiver System
by: Cristian Vidrascu v. 16 i. 1 p. 147 - 154
Discovering Associations in Very Large Databases by Approximating
by: Shichao Zhang, Chengqi Zhang v. 16 i. 1 p. 155 - 177
Mining Dynamic databases by Weighting
by: Shichao Zhang, Li Liu v. 16 i. 1 p. 179 - 205
Incorporating Linkage Learning into the GeLog Framework
by: Tim Fühner, Gabriella Kókai v. 16 i. 2 p. 209 - 228
Various Robust Search Methods in a Hungarian Speech Recognition System
by: Gábor Gosztolya, András Kocsor, László Tóth v. 16 i. 2 p. 229 - 240
Implementing Global Constraints as Graphs of Elementary Constraints
by: Dávid Hanák v. 16 i. 2 p. 241 - 258
On Implementing Relational Databases on DNA Strands
by: István Katsányi v. 16 i. 2 p. 259 - 270
Various Hyperplane Classifiers Using Kernel Feature Spaces
by: Kornél Kovács, András Kocsor v. 16 i. 2 p. 271 - 278
Probabilistic Diagnostics with P-Graphs
by: Balázs Polgár, Endre Selényi v. 16 i. 2 p. 279 - 291
Programming by steps
by: Raluca Oana Scarlatescu v. 16 i. 2 p. 293 - 314
Two Content Protection Schemes for Digital Items
by: Paula Steinby v. 16 i. 2 p. 315 - 326
Evaluation of a Fully Automatic Medical Image Registration Algorithm Based on Mutual Information
by: Attila Tanács, Attila Kuba v. 16 i. 2 p. 327 - 336
A Graphical User Interface for Evolutionary Algorithms
by: Zoltán Tóth v. 16 i. 2 p. 337 - 365

2002

A form of the Zermelo-von Neumann theorem under minimal assumptions
by: B. Csákány v. 15 i. 3 p. 321 - 325
Automaton Theory Approach for Solving Modified PNS Problems
by: Balázs Imreh v. 15 i. 3 p. 327 - 338
Factorizations of Languages and Commutativity Conditions
by: Alexandru Mateescu, Arto Salomaa, Sheng Yu v. 15 i. 3 p. 339 - 351
Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions
by: Alexander Meduna, Martin Svec v. 15 i. 3 p. 353 - 360
Closed On-Line Bin Packing
by: E. Asgeirsson, Urtzi Ayesta, Edward G. Coffman Jr., J. Etra, Petar Momcilovic, D. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe v. 15 i. 3 p. 361 - 367
A PTAS for single machine scheduling with controllable processing times
by: Petra Schuurman, Gerhard J. Woeginger v. 15 i. 3 p. 369 - 378
An Arithmetic Theory of Consistency Enforcement
by: Sebastian Link, Klaus-Dieter Schewe v. 15 i. 3 p. 379 - 416
Definition of a Parallel Execution Model with Abstract State Machines
by: Zsolt Németh v. 15 i. 3 p. 417 - 455
Properties of Composite of Closure Operations and Choice Functions
by: Nghia D. Vu, Bina Ramamurthy v. 15 i. 3 p. 457 - 465
The Home Marking Problem and Some Related Concepts
by: Roxana Melinte, Olivia Oanea, Ioana Olga, Ferucio Laurentiu Tiplea v. 15 i. 3 p. 467 - 478
Human Cognition of Complex Thought Patterns
by: Harry M. Sneed v. 15 i. 4 p. 481 - 487
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
by: Csaba Faragó, Tamás Gergely v. 15 i. 4 p. 489 - 508
XML Semantics Extension
by: Ferenc Havasi v. 15 i. 4 p. 509 - 528
Mathematical models for simulation of continuous grinding process with recirculation
by: Piroska B. Kis, Csaba Mihálykó, Béla G. Lakatos v. 15 i. 4 p. 529 - 545
Implemeting a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams
by: Johannes Koskinen, Erkki Mäkinen, Tarja Systä v. 15 i. 4 p. 547 - 565
A distributed program synthesizer
by: Vahur Kotkas v. 15 i. 4 p. 567 - 581
Automatic Test Selection based on CEFSM Specifications
by: Gábor Kovács, Zoltán Pap, Gyula Csopaki v. 15 i. 4 p. 583 - 599
Resource-Conscious AI Planning with Conjunctions and Disjunctions
by: Peep Küngas v. 15 i. 4 p. 601 - 620
Experiences in Modelling Feature Interactions with Coloured Petri Nets
by: Louise Lorentsen, Antti-Pekka Tuovinen, Jianli Xu v. 15 i. 4 p. 621 - 632
Framework for Studying Substitution
by: Härmel Nestra v. 15 i. 4 p. 633 - 652
Standardized Event Pair Based Test Generation Method Using TSS&TP
by: Zoltán Pap, Zoltán Rétháti, Róbert Horváth, Gusztáv Adamis v. 15 i. 4 p. 653 - 667
Recognizing Design Patterns in C++ Programs with the Integration of Columbus and Maisa
by: Rudolf Ferenc, Juha Gustafsson, László Müller, Jukka Paakki v. 15 i. 4 p. 669 - 682
Development of a Communication Environment between IPv6 and IPv4
by: Gábor Fóris, László Sógor, Péter Hendlein, Krisztián Notaisz, Márta Fidrich v. 15 i. 4 p. 683 - 704
Platform Independent Tool for Local Event Correlation
by: Risto Vaarandi v. 15 i. 4 p. 705 - 723

2001

On some algebraic properties of automata
by: András Ádám v. 15 i. 1 p. 1 - 8
P Systems with Communication Based on Concentration
by: Jürgen Dassow, Gheorghe Paun v. 15 i. 1 p. 9 - 24
A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages
by: Pál Dömösi, Satoshi Okawa v. 15 i. 1 p. 25 - 32
On isomorphic representations of generalized definite automata
by: Ferenc Gécseg, Balázs Imreh v. 15 i. 1 p. 33 - 44
Languages Recognized by a Class of Finite Automata
by: Andrei Kelarev, Olga Sokratova v. 15 i. 1 p. 45 - 52
P Systems with Picture Objects
by: Shankara Narayanan Krishna, Raghavan Rama, Kamala Krithivasan v. 15 i. 1 p. 53 - 74
Logical definability of Y-tree and trellis systolic omega-languages
by: Angelo Monti, Adriano Peron v. 15 i. 1 p. 75 - 100
Affine matching of two sets of points in arbitrary dimensions
by: Attila Tanács, Gábor Czédli, Kálmán Palágyi, Attila Kuba v. 15 i. 1 p. 101 - 106
The complexity of coloring graphs without long induced paths
by: Gerhard J. Woeginger, Jiri Sgall v. 15 i. 1 p. 107
Motion Planning Algorithms for Stratified Kinematic Systems with Application to the Hexapod Robot
by: István Harmati, Bálint Kiss v. 15 i. 2
An online scheduling algorithm for a two-layer multiprocessor architecture
by: Csanád Imreh v. 15 i. 2
Parallelization of an algorithm for the automatic detection of deformable objects
by: J. M. González-Linares, Nicolás Guil Mata, Emilio L. Zapata, Pilar Martínez Ortigosa, Inmaculada García v. 15 i. 2
Parallel Simulation of Spiral Waves in Reacting and Diffusing Media
by: Eva M. Ortigosa, Luis F. Romero, J. I. Ramos v. 15 i. 2
The Debug Slicing of Logic Programs
by: Gyöngyi Szilágyi, László Harmath, Tibor Gyimóthy v. 15 i. 2
Generation and Reconstruction of hv-convex 8-connected Discrete Sets
by: Emese Balogh v. 15 i. 2
SmallSteps: An Adaptive Distance-based Clustering Algorithm
by: Gy. Koch, József Dombi v. 15 i. 2
A 3D Parallel Shrinking Algorithm
by: Kálmán Palágyi v. 15 i. 2
Parallel implementation for large and sparse eigenproblems
by: Ester M. Garzón, Inmaculada García v. 15 i. 2
Learning Decision Trees in Continuous Space
by: Józef Dombi, Á. Zsiros v. 15 i. 2
Sets of integers in different number systems and the Chomsky hierarchy
by: István Katsányi v. 15 i. 2
A Fuzzy Approach for Mining Quantitative Association Rules
by: Attila Gyenesei v. 15 i. 2
Using Decision Trees to Infer Semantic Functions of Attribute Grammars
by: Szilvia Zvada, Tibor Gyimóthy v. 15 i. 2

2000

Hybrid Concurrency Control and Recovery for Multi-Level Transactions
by: Klaus-Dieter Schewe, Torsten Ripke, Sven Drechsler v. 14 i. 3 p. 419 - 453
A Note on Decidability of Reachability for Conditional Petri Nets
by: Ferucio Laurentiu Tiplea, Cristina Badarau v. 14 i. 3 p. 455 - 459
Unusual Algorithms for Lexicographical Enumeration
by: Pál Dömösi v. 14 i. 3 p. 461 - 468
Inferring pure context-free languages from positive data
by: Takeshi Koshiba, Erkki Mäkinen, Yuji Takada v. 14 i. 3 p. 469 - 477
On inferring zero-reversible languages
by: Erkki Mäkinen v. 14 i. 3 p. 479 - 484
F codes
by: Marek Michalik v. 14 i. 3 p. 485 - 489
Note on the Cardinality of some Sets of Clones
by: Jovanka Pantovic, Dusan Vojvodic v. 14 i. 3 p. 491 - 495
A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems
by: Balázs Imreh, J. Fülöp, Ferenc Friedler v. 14 i. 3 p. 497 - 501
Note on the Work Function Algorithm
by: Béla Csaba v. 14 i. 3 p. 503 - 506
Modular Reinforcement Learning: A Case Study in a Robot Domain
by: Zsolt Kalmár, Csaba Szepesvári, András Lörincz v. 14 i. 3 p. 507 - 522
Acts Over Completely O-Simple Semigroups
by: A. Yu. Avdeyev, I. B. Kozhukhov v. 14 i. 4 p. 523 - 531
The Logic of Knights, Knaves, Normals and Mutes
by: L. Aszalós v. 14 i. 4 p. 533 - 540
Equivalence of Mealy and Moore Automata
by: I. Babcsányi v. 14 i. 4 p. 541 - 552
Pseudo-Hamiltonian Graphs
by: Luitpold Babel, Gerhard J. Woeginger v. 14 i. 4 p. 553 - 567
Two remarks on variants of simple eco-grammar systems
by: Judit Csima v. 14 i. 4 p. 569 - 582
On Kleene Algebras of Ternary Co-Relations
by: Igor Dolinka v. 14 i. 4 p. 583 - 595
Results concerning EOL and COL power series
by: Juha Honkala v. 14 i. 4 p. 597 - 605
On commutative asynchronous nondeterministic automata
by: Balázs Imreh, M. Ito, A. Pukler v. 14 i. 4 p. 607 - 617
Difference Functions of Dependence Spaces
by: Jouni Järvinen v. 14 i. 4 p. 619 - 630
Elementary decomposition of soliton automata
by: Miklós Bartha, Miklós Krész v. 14 i. 4 p. 631 - 652
Regulated Pushdown Automata
by: Alexander Meduna, Dusan Kolar v. 14 i. 4 p. 653 - 664

1999

On Some Cyclic Connectivity Properties of Directed Graphs (Examples and Problems)
by: András Ádám v. 14 i. 1 p. 1 - 12
Two Simple Algorithms for bin Covering
by: János Csirik, J. B. G. Frenk, Martine Labbé, S. Zhang v. 14 i. 1 p. 13 - 26
On 1-Representations of Integers
by: János Demetrovics, Attila Pethö, Lajos Rónyai v. 14 i. 1 p. 27 - 36
Complete Finite Automata Network Graphs with Minimal Number of Edges
by: Pál Dömösi, Chrystopher L. Nehaniv v. 14 i. 1 p. 37 - 50
Trips on Trees
by: Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal Van Best v. 14 i. 1 p. 51 - 64
Axiomatizing Iteration Categories
by: Zoltán Ésik v. 14 i. 1 p. 65 - 82
On One-Pass Term Rewriting
by: Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi v. 14 i. 1 p. 83 - 98
A Note on the Star-Product
by: Balázs Imreh, Masami Ito v. 14 i. 1 p. 99 - 104
Directable Nondeterministic Automata
by: Balázs Imreh, Magnus Steinby v. 14 i. 1 p. 105 - 116
Syntactic Monoids of Codes
by: Helmut Jürgensen v. 14 i. 1 p. 117 - 134
Tree Transducers and Formal Tree Series
by: Werner Kuich v. 14 i. 1 p. 135 - 164
Duplication Grammars
by: Carlos Martín-Vide, Gheorghe Paun v. 14 i. 1 p. 151 - 164
Some Properties of Duplication Grammars
by: Victor Mitrana, Grzegorz Rozenberg v. 14 i. 1 p. 165 - 178
Watson-Crick Walks and Roads on DOL Graphs
by: Arto Salomaa v. 14 i. 1 p. 179 - 192
Generalized Fairness and Context-Free Languages
by: Kai Salomaa, Sheng Yu v. 14 i. 1 p. 193 - 204
Preface - Papers from the Conference for PhD Students in Computer Science
by: Tibor Csendes, Zoltán Fülöp v. 14 i. 2 p. 215 - 216
On the Partitioning Algorithm
by: Béla Csaba v. 14 i. 2 p. 217 - 228
Test Suite Reduction in Conformance Testing
by: Tibor Csöndes, Sarolta Dibuz, Balázs Kotnyek v. 14 i. 2 p. 229 - 238
A Family of Fast Constant-Space Substring Search Algorithms
by: Harri Hakonen, Timo Raita v. 14 i. 2 p. 239 - 250
On Merging Reduction of the Process Network Synthesis Problem
by: Cs. Holló, Z. Blázsik, Csanád Imreh, Z. Kovacs v. 14 i. 2 p. 251 - 262
Construction of Recursive Algorithms for Polarity Matrices Calculation in Polynomial Logical Function Representation
by: Dragan Jankovic v. 14 i. 2 p. 263 - 284
Object-Oriented Model for Partially Seperable Functions in Parameter Estimation
by: Jaakko Järvi v. 14 i. 2 p. 285 - 302
Hausdorff Dimension of Univoque Sets
by: Gábor Kallós v. 14 i. 2 p. 303 - 314
Optimal Parameters of a Sinusoidal Representation of Signals
by: András Kocsor, László Tóth, I. Bálint v. 14 i. 2 p. 315 - 330
Improved Greedy Algorithm for Computing Approximate Median Strings
by: Ferenc Kruzslicz v. 14 i. 2 p. 331 - 340
Limiting Distortion of a Wavelet Image Codec
by: Joonas Lehtinen v. 14 i. 2 p. 341 - 356
On the Exact Solution of the Euclidean Three-Matching Problem
by: Gábor Magyar, Mika Johnsson, Olli Nevalainen v. 14 i. 2 p. 357 - 376
Testing Internet Applications - Terminology and Applicability
by: Mazen Malek, Roland Gecse v. 14 i. 2 p. 377 - 388
A Study of Portability in the Deployment of WWW
by: András Micsik v. 14 i. 2 p. 389 - 402
A Parallelized Sequential Random Search Global Optimization Algorithm
by: Pilar Martínez Ortigosa, J. Balogh, Inmaculada García v. 14 i. 2 p. 403 - 418

1998

NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars
by: Markus Lohrey v. 13 i. 3 p. 209 - 224
Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars
by: Alexander Meduna v. 13 i. 3 p. 225 - 242
Isomorphic Representation of Nondeterministic Nilpotent Automata
by: Ildikó Székely v. 13 i. 3 p. 243 - 256
On the Information Content of Semi-Structured Databases
by: Mark Levene v. 13 i. 3 p. 257 - 276
Limitations of Rule Triggering Systems for Integrity Maintenance in the Context of Transition Specifications
by: Klaus-Dieter Schewe, Bernhard Thalheim v. 13 i. 3 p. 277 - 304
Non-Markovian Policies in Sequential Decision Problems
by: Csaba Szepesvári v. 13 i. 3 p. 305 - 318
On Decision-Mappings Related to Process Network Synthesis Problem
by: Z. Blázsik, Cs. Holló, Balázs Imreh v. 13 i. 3 p. 319 - 328
On the Reformulation of Some Classes of PNS-Problems as Set Covering Problems
by: J. Fülöp, Balázs Imreh, Ferenc Friedler v. 13 i. 3 p. 329 - 338
Grammars Working on Layered Strings
by: Paolo Bottoni, Giancarlo Mauri, Piero Mussio, Gheorghe Paun v. 13 i. 4 p. 339 - 358
On Extended Simple Eco-grammar Systems
by: Judit Csima v. 13 i. 4 p. 359 - 374
Descriptional Complexity of Multi-Continuous Grammars
by: Alexander Meduna v. 13 i. 4 p. 375 - 384
Decompositions of Automata and Transition Semigroups
by: Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic v. 13 i. 4 p. 385 - 404
On Minimal and Maximal Clones II
by: László Szabó v. 13 i. 4 p. 405 - 412
Improving Storage Handling of Interval Methods for Global Optimization
by: A. E. Csallner v. 13 i. 4 p. 413 - 422
Minimizing the Number of Tardy Jobs
by: Günter Rote, Gerhard J. Woeginger v. 13 i. 4 p. 423 - 430
Generalized Dependencies in Relational Databases
by: Attila Sali Sr., Attila Sali v. 13 i. 4 p. 431 - 438
Analysis of the Completion Time of Markov Reward Models
by: Miklós Telek, András Pfening, Gábor Fodor v. 13 i. 4 p. 439

1997

Regular Expression Star-Freeness is PSPACE-Complete
by: L. Bernátsky v. 13 i. 1 p. 1 - 22
Server Problems and Regular Languages
by: Béla Csaba, G. Dányi v. 13 i. 1 p. 23 - 40
On alphai-Products of Nondeterministic Tree Automata
by: Balázs Imreh v. 13 i. 1 p. 41 - 54
On Lexicographic Enumeration of Regular and Context-Free Languages
by: Erkki Mäkinen v. 13 i. 1 p. 55 - 62
Bounded Space On-Line Variable-Sized Bin Packing
by: Rainer E. Burkard, Guochuan Zhang v. 13 i. 1 p. 63 - 76
Generalized Harary Games
by: András Pluhár v. 13 i. 1 p. 77 - 84
Evaluation Strategies of Fuzzy Datalog
by: Ágnes Achs v. 13 i. 1 p. 85 - 102
Framework for Generating Object-Oriented Databases from Conceptual Specifications
by: György Kovács, Patrick van Bommel v. 13 i. 2 p. 103 - 140
CD Grammar Systems and Trajectories
by: Alexandru Mateescu v. 13 i. 2 p. 141 - 158
On Hybrid Connectionist-Symbolic Models
by: Petr Sosík v. 13 i. 2 p. 159 - 172
Various Communications in PC Grammar Systems
by: György Vaszil v. 13 i. 2 p. 173 - 196
On Two-Step Methods for Stochastic Differential Equations
by: Rózsa Horváth Bokor v. 13 i. 2 p. 197 - 207

1996

On Representing RE Languages by One-Sided Internal Contextual Languages
by: Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa v. 12 i. 3 p. 217 - 234
Growth Functions and Length Sets of Replicating Systems
by: Valeria Mihalache, Arto Salomaa v. 12 i. 3 p. 235 - 248
The Reflexive Domain of CPO's Ideals
by: Gabriel Ciobanu v. 12 i. 3 p. 249 - 260
On Domain and Range Tree Languages of Superlinear Deterministic Top-down Tree Transformations
by: Gábor Dányi v. 12 i. 3 p. 261 - 278
On Binary Minimal Clones
by: L. Lévai, P. P. Pálfy v. 12 i. 3 p. 279 - 294
On a Normal Form of Petri Nets
by: Ferucio Laurentiu Tiplea, Masashi Katsura, Masami Ito v. 12 i. 3 p. 295 - 308
A Note on Connection Between PNS and Set Covering Problems
by: Z. Blázsik, Balázs Imreh v. 12 i. 3 p. 309 - 312
Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle
by: Rainer E. Burkard, Tibor Dudás v. 12 i. 3 p. 313 - 324
Grammar Systems: Recent Results and Perspectives (Foreword)
by: Erzsébet Csuhaj-Varjú v. 12 i. 4 p. 325 - 330
Fairness in Grammar Systems
by: Jürgen Dassow, Victor Mitrana v. 12 i. 4 p. 331 - 346
On Competence and Completeness in CD Grammar Systems
by: Henning Bordihn, Erzsébet Csuhaj-Varjú v. 12 i. 4 p. 347 - 360
Accepting Multi-Agent Systems II
by: Henning Fernau, Markus Holzer v. 12 i. 4 p. 361 - 380
PC Grammar Systems: Recent Results, Open Problems
by: Gheorghe Paun v. 12 i. 4 p. 381 - 396
PC Grammar Systems with Separated Alphabets
by: Valeria Mihalache v. 12 i. 4 p. 397 - 410
On Regular Characterizations of Languages by Grammar Systems
by: Lucian Ilie, Arto Salomaa v. 12 i. 4 p. 411 - 426
Teams in Grammar Systems: Hybridity and Weak Rewriting
by: Maurice H. ter Beek v. 12 i. 4 p. 427 - 444
Test Tube Systems or How to Bake a DNA Cake
by: Rudolf Freund, Franziska Freund v. 12 i. 4 p. 445 - 460
Natural Language Understanding: a New Challenge for Grammar Systems
by: Carlos Martín-Vide v. 12 i. 4 p. 461 - 472

1995

Generalised DOL Trees
by: Lila Kari, Grzegorz Rozenberg, Arto Salomaa v. 12 i. 1 p. 1 - 10
On Isomorphic Representation of Nondeterministic Tree Automata
by: Balázs Imreh v. 12 i. 1 p. 11 - 22
Some Remarks on Directable Automata
by: Balázs Imreh, Magnus Steinby v. 12 i. 1 p. 23 - 36
The Optimistic and Cautius Semantics for Inconsistent Knowledge Bases
by: John Grant, V. S. Subrahmanian v. 12 i. 1 p. 37 - 56
Reconstruction of Unique Binary Matrices with Prescribed Elements
by: Attila Kuba v. 12 i. 1 p. 57 - 70
Demonstration of a Problem-Solving Method
by: Judit Nyéki-Gaizler, Márta Konczné-Nagy, Ákos Fóthi, Éva Harangozó v. 12 i. 1 p. 71 - 82
Parallel Asynchronous Computation of the Values of an Assotiative Function
by: Zoltán Horváth v. 12 i. 1 p. 83 - 94
Towards Computer Aided Development of Parallel Compilers Running on Transputer Architecture
by: János Toczki v. 12 i. 1 p. 95 - 106
On Graphs with Perfect Internal Matchings
by: Miklós Bartha, Éva Gombás v. 12 i. 2 p. 111 - 124
Remarks on the Interval Number of Graphs
by: András Pluhár v. 12 i. 2 p. 125 - 130
Right Group-Type Automata
by: I. Babcsányi, A. Nagy v. 12 i. 2 p. 131 - 136
Some Properties of H-Functions
by: Ivan Mirchev, Borislav Yurukov v. 12 i. 2 p. 137 - 144
Quasioptimal Bound for the Length of Reset Words for Regular Automata
by: I. K. Rystsov v. 12 i. 2 p. 145 - 152
Fuzzy Extension of Datalog
by: Ágnes Achs, Attila Kiss v. 12 i. 2 p. 153 - 166
Some Remarks On Generating Armstrong And Inferring Functional Dependencies Relation
by: János Demetrovics, Vu Duc Thi v. 12 i. 2 p. 167 - 180
A Lattice View of Functional Dependencies in Incomplete Relations
by: Mark Levene v. 12 i. 2 p. 181 - 208
On a Tour Construction Heuristic for the Asymmetric TSP
by: I. Bartalos, T. Dudás, Balázs Imreh v. 12 i. 2 p. 209 - 216

1994

Mealy-Automata in Which the Output-Equivalence is a Congruence
by: I. Babcsányi, A. Nagyr v. 11 i. 3 p. 121 - 126
Measure of Infinitary Codes
by: Nguyen Huong Lam, Do Long Van v. 11 i. 3 p. 127 - 138
A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing
by: Heinz Faßbender, Heiko Vogler v. 11 i. 3 p. 139 - 168
Radical Theory for Group Semiautomata
by: Y. Fong, F. K. Huang, R. Wiegandt v. 11 i. 3 p. 169 - 188
Structuring Grammar Systems by Priorities and Hierarchies
by: Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg v. 11 i. 3 p. 189 - 204
Normal Forms and Minimal Keys in the Relational Datamodel
by: János Demetrovics, Vu Duc Thi v. 11 i. 3 p. 205 - 216
On Strong-Generalized Positive Boolean Dependencies
by: Le Thi Thanh v. 11 i. 3 p. 217 - 232
Partitioning Graphs into Two Trees
by: Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao v. 11 i. 3 p. 233 - 240
Codes and Infinite Words
by: Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger v. 11 i. 4 p. 241 - 256
A Note on Regular Strongly Shuffle-Closed Languages
by: Balázs Imreh, A. M. Ito v. 11 i. 4 p. 257 - 260
A Pumping Lemma for Output Languages of Attributed Tree Transducers
by: Armin Kühnemann, Heiko Vogler v. 11 i. 4 p. 261 - 306
On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions
by: Alexander Meduna, A. Gopalaratnam v. 11 i. 4 p. 307 - 324
Invariance Groups of Threshold Functions
by: E. K. Horváth v. 11 i. 4 p. 325 - 332
On the Complexity of Dynamic Tests for Logic Functions
by: V. A. Vardanian v. 11 i. 4 p. 333 - 344
Some Remarks on Functional Dependencies in Relational Datamodels
by: Vu Duc Thi, Le Thi Thanh v. 11 i. 4 p. 345 - 352

1993

A Tourist Guide through Treewidth
by: Hans L. Bodlaender v. 11 i. 1-2 p. 1 - 22
A Lower Bound for On-Line Vector-Packing Algorithms
by: Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger v. 11 i. 1-2 p. 23 - 34
Some Problems Concerning Armstrong Relations of Dual Schemes and Relation Schemes in the Relational Datamodel
by: János Demetrovics, Vu Duc Thi v. 11 i. 1-2 p. 35 - 48
Fundamental Concepts of Object Oriented Databases
by: Klaus-Dieter Schewe, Bernhard Thalheim v. 11 i. 1-2 p. 49 - 84
On the Characterization of the Integers: The Hidden Function Problem Revisited
by: Rudolf Berghammer v. 11 i. 1-2 p. 85 - 96
On Codes of Bi-Infinite Words
by: Do Long Van, Nguyen Huong Lam, Phan Trung Huy v. 11 i. 1-2 p. 97 - 110
Market Oriented Integration of MS-Windows-Based Tools for Distributed Decision Support
by: M. Biró, P. Danyi, P. Gelléri v. 11 i. 1-2 p. 111 - 119

1992

On the Randomized Complexity of Monotone Graph Properties
by: Hans Dietmar Gröger v. 10 i. 3 p. 119 - 128
On the Interaction Between Closure Operations and Choice Functions with Applications to Relational Database
by: János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik v. 10 i. 3 p. 129 - 140
Normal Form Relation Schemes: A New Characterization
by: János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik v. 10 i. 3 p. 141 - 164
Symbiotic EOL Systems
by: Alexander Meduna v. 10 i. 3 p. 165 - 172
Alternation Bounds for Tree Automata
by: Kai Salomaa v. 10 i. 3 p. 173 - 198
Initial and Final Congruences
by: Virgil Emil Cazanescu, Rodica Ceterchi v. 10 i. 3 p. 199 - 216
A Note on Intersection of Isotone Clones
by: János Demetrovics, Lajos Rónyai v. 10 i. 3 p. 217 - 220
A Criterion for the Simplicity of Finite Moore Automata
by: András Ádám v. 10 i. 4 p. 221 - 236
On a Special Composition of Tree Automata
by: Balázs Imreh v. 10 i. 4 p. 237 - 242
Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure
by: Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa v. 10 i. 4 p. 243 - 254
The Boolean Closure of DR-Recognizable Tree Languages
by: Eija Jurvanen v. 10 i. 4 p. 255 - 272
A Queuing Model for a Processor-Shared Multi-Terminal System Subject to Breakdowns
by: B. Almási v. 10 i. 4 p. 273 - 282
The Self-organizing List and Processor Problems under Randomized Policies
by: T. Makjamroen v. 10 i. 4 p. 283 - 302
Computing Maximum Valued Regions
by: Gerhard J. Woeginger v. 10 i. 4 p. 303 - 316
On the Boolean Structure of Fuzzy Logical Systems: A Counter Example
by: József Dombi, Gy. Lencsés v. 10 i. 4 p. 317 - 322
On Minimal and Maximal Clones
by: László Szabó v. 10 i. 4 p. 323 - 327

1991

Analysis of the SCAN Service Polling Model
by: Brian D. Bunday v. 10 i. 1-2 p. 1 - 14
Heuristic for the 0-1 Min-Knapsack Problem
by: János Csirik, J. B. G. Frenk, Martine Labbé, S. Zhang v. 10 i. 1-2 p. 15 - 20
A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectange Bin-Packing
by: Gábor Galambos v. 10 i. 1-2 p. 21 - 24
On Strict Codes
by: Nguyen Huong Lam, Do Long Van v. 10 i. 1-2 p. 25 - 34
Free Submonoids and Minimal omega-Generators of Romega
by: Igor Litovsky v. 10 i. 1-2 p. 35 - 44
Special Families of Matrix Languages and Decidable Problems
by: Alexandru Mateescu v. 10 i. 1-2 p. 45 - 52
Boolean-Type Retractable Automata with Traps
by: A. Nagy v. 10 i. 1-2 p. 53 - 64
Language Representations Starting from Fully Initial Languages
by: Gheorghe Paun, Sorina Vicolov v. 10 i. 1-2 p. 65 - 70
Modelling of Heterogeneous Multiprocessor Systems with Randomly Changing Parameters
by: János Sztrik v. 10 i. 1-2 p. 71 - 84
Modelling of a Communication System Evolving in a Random Environment
by: János Sztrik, L. Lukashuk v. 10 i. 1-2 p. 85 - 92
Weak Dependencies in the Relational Datamodel
by: Vu Duc Thi, N. K. Anh v. 10 i. 1-2 p. 93 - 100
Covering Morphisms and Unique Minimal D-Schemes
by: Ralph Tindell v. 10 i. 1-2 p. 101 - 112
A Note on Fully Initial Grammars
by: Sorina Vicolov v. 10 i. 1-2 p. 113 - 118

1990

Towards languages that support program derivation, or control modularity considered harmful
by: Reino Kurki-Suonio v. 9 i. 3 p. 179 - 192
Techniques for Modular language implementation
by: Kai Koskimies v. 9 i. 3 p. 193 - 200
An error - recovering from of DCGs
by: Jukka Paakki, Kori Toppola v. 9 i. 3 p. 212 - 221
Uniform approach to parameter transmission mechanisms, coercions, optional parameters and patterns
by: Matti O. Jokinen v. 9 i. 3 p. 223 - 233
Generation of test cases for simple prolog programs
by: Pekka Kilpeläinen, Heikki Mannila v. 9 i. 3 p. 235 - 246
A natural language interface based on attribute grammars
by: Zoltán Alexin, József Dombi, Károly Fábricz, Tibor Gyimóthy v. 9 i. 3 p. 247 - 255
Data pictures on the desktop
by: Ágnes Hernádi, A. Heppes, Elöd Knuth v. 9 i. 3 p. 257 - 268
YYY - A database design tool
by: Harri Laine v. 9 i. 3 p. 269 - 280
Frames for protocal description
by: Solly Wagner-Dibuz v. 9 i. 3 p. 281 - 289
A programming environment for a transputer-based multiprocessor system
by: M. Aspnäs, Ralph-Johan Back v. 9 i. 3 p. 291 - 301
PICA - A graphical program development tool
by: Aimo A. Törn v. 9 i. 3 p. 303 - 321
MICROTEST - A testing tool on PC
by: István Forgács, Attila Horváth, Endre Somos v. 9 i. 3 p. 323 - 332
Recognizable sets of finite bilabelled transition systems
by: A. Arnold v. 9 i. 4 p. 333 - 347
A note on axiomatizing flowchart schemes
by: Virgil Emil Cazanescu, Gheorghe Stefanescu v. 9 i. 4 p. 349 - 359
On the multidimensional vector bin packing
by: János Csirik, J. B. G. Frenk, Martine Labbé, S. Zhang v. 9 i. 4 p. 361 - 369
Product hierarchies of automata and homomorphic simulation
by: Pál Dömösi, Zoltán Ésik v. 9 i. 4 p. 371 - 373
A note on the axiomatization of iteration theories
by: Zoltán Ésik v. 9 i. 4 p. 375 - 384
Investigation on Armstrong relations, dependency inference, and excluded functional dependencies
by: Georg Gottlob, Leonid Libkin v. 9 i. 4 p. 385 - 402
The complexity of a counting finite-state automation
by: Craig A. Rich, Giora Slutzki v. 9 i. 4 p. 403 - 417
Decision problems arising from knapsack transformations
by: Arto Salomaa v. 9 i. 4 p. 419 - 440
Preserving two-tuple dependencies under projection
by: Bernhard Thalheim, E. Al-Fedhagi v. 9 i. 4 p. 441 - 458

1989

Asymptotic analysis of some controlled finite-source queuing systems
by: V. V. Anisimov, János Sztrik v. 9 i. 1 p. 27 - 38
A Decomposition Theorem for a class of infinite transformation semigroups
by: Ralph P. Tucci v. 9 i. 1 p. 39 - 54
Two transformations on attribute grammars improving the complexity of their evaluation
by: Éva Gombás, Miklós Bartha v. 9 i. 1 p. 55 - 72
Key ad superkey for a closure function
by: Le Van Bao, Ho Thuan v. 9 i. 1 p. 73 - 88
On the worst-case performance of the NkF bin-packing heuristic
by: János Csirik, Balázs Imreh v. 9 i. 2 p. 89 - 105
On the performance of on-line algorithms for partition problems
by: Ulrich Faigle, Walter Kern, György Turán v. 9 i. 2 p. 107 - 119
Determination of the structure of the class (R, S) of (0, 1)-matrices
by: Attila Kuba v. 9 i. 2 p. 121 - 132
Parallel programming structures and attribute grammars
by: R. Alvarez Gil, Á. Makay v. 9 i. 2 p. 133 - 141
On fully initial grammars with regulated rewriting
by: Alexandru Mateescu, Gheorghe Paun v. 9 i. 2 p. 157 - 165
On star-product of automata
by: Ferenc Gécseg, Balázs Imreh v. 9 i. 2 p. 167 - 172
On characteristic semigroups of Mealy automata
by: Genjiro Tanaka v. 9 i. 2 p. 173 - 177

1988

Pure languages of regulated rewriting and their codings
by: Jürgen Dassow v. 8 p. 227 - 235
On state grammars
by: Alexander Meduna, Gy. Horváth v. 8 p. 237 - 245
A note on the generalized nui-product
by: Balázs Imreh v. 8 p. 247 - 252
On the hiearchy of nui-product
by: Pál Dömösi, Zoltán Ésik v. 8 p. 253 - 257
On ranges of compositions of deterministic root-to-frontier tree transformations
by: Sándor Vágvölgyi, Zoltán Fülöp v. 8 p. 259 - 266
On the numbers of shortes keys in relational databases on non-uniform domains
by: O. Selesnjew, Bernhard Thalheim v. 8 p. 267 - 271