Acta Cybernetica
2003
- Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automataby: Zoltán Ésik, Masami Ito v. 16 i. 1 p. 1 - 28
- On D0L systems with finite axiom setsby: Juha Honkala v. 16 i. 1 p. 29 - 35
- On directable nondeterministic trapped automataby: Balázs Imreh, Csanád Imreh, Masami Ito v. 16 i. 1 p. 37 - 45
- On variable sized vector packingby: Leah Epstein v. 16 i. 1 p. 47 - 56
- On-Line Maximizing the Number of Items Packed in Variable-Sized Binsby: Leah Epstein, Lene M. Favrholdt v. 16 i. 1 p. 57 - 66
- SW-type puzzles and their graphsby: Benedek Nagy v. 16 i. 1 p. 67 - 82
- Infinite limits and R-recursive functionsby: Jerzy Mycka v. 16 i. 1 p. 83 - 91
- Derivation of Incremental Equations for PNF Nested Relationsby: Jixue Liu, Millist W. Vincent v. 16 i. 1 p. 93 - 131
- Velocity and Distance of Neighbourhood Sequencesby: András Hajdu, Lajos Hajdu v. 16 i. 1 p. 133 - 145
- Modelling a Sender-Receiver Systemby: Cristian Vidrascu v. 16 i. 1 p. 147 - 154
- Discovering Associations in Very Large Databases by Approximatingby: Shichao Zhang, Chengqi Zhang v. 16 i. 1 p. 155 - 177
- Mining Dynamic databases by Weightingby: Shichao Zhang, Li Liu v. 16 i. 1 p. 179 - 205
- Incorporating Linkage Learning into the GeLog Frameworkby: Tim Fühner, Gabriella Kókai v. 16 i. 2 p. 209 - 228
- Various Robust Search Methods in a Hungarian Speech Recognition Systemby: Gábor Gosztolya, András Kocsor, László Tóth v. 16 i. 2 p. 229 - 240
- Implementing Global Constraints as Graphs of Elementary Constraintsby: Dávid Hanák v. 16 i. 2 p. 241 - 258
- On Implementing Relational Databases on DNA Strandsby: István Katsányi v. 16 i. 2 p. 259 - 270
- Various Hyperplane Classifiers Using Kernel Feature Spacesby: Kornél Kovács, András Kocsor v. 16 i. 2 p. 271 - 278
- Probabilistic Diagnostics with P-Graphsby: Balázs Polgár, Endre Selényi v. 16 i. 2 p. 279 - 291
- Programming by stepsby: Raluca Oana Scarlatescu v. 16 i. 2 p. 293 - 314
- Two Content Protection Schemes for Digital Itemsby: Paula Steinby v. 16 i. 2 p. 315 - 326
- Evaluation of a Fully Automatic Medical Image Registration Algorithm Based on Mutual Informationby: Attila Tanács, Attila Kuba v. 16 i. 2 p. 327 - 336
- A Graphical User Interface for Evolutionary Algorithmsby: Zoltán Tóth v. 16 i. 2 p. 337 - 365
- A form of the Zermelo-von Neumann theorem under minimal assumptionsby: B. Csákány v. 15 i. 3 p. 321 - 325
- Automaton Theory Approach for Solving Modified PNS Problemsby: Balázs Imreh v. 15 i. 3 p. 327 - 338
- Factorizations of Languages and Commutativity Conditionsby: 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 Productionsby: Alexander Meduna, Martin Svec v. 15 i. 3 p. 353 - 360
- Closed On-Line Bin Packingby: 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 timesby: Petra Schuurman, Gerhard J. Woeginger v. 15 i. 3 p. 369 - 378
- An Arithmetic Theory of Consistency Enforcementby: Sebastian Link, Klaus-Dieter Schewe v. 15 i. 3 p. 379 - 416
- Definition of a Parallel Execution Model with Abstract State Machinesby: Zsolt Németh v. 15 i. 3 p. 417 - 455
- Properties of Composite of Closure Operations and Choice Functionsby: Nghia D. Vu, Bina Ramamurthy v. 15 i. 3 p. 457 - 465
- The Home Marking Problem and Some Related Conceptsby: Roxana Melinte, Olivia Oanea, Ioana Olga, Ferucio Laurentiu Tiplea v. 15 i. 3 p. 467 - 478
- Human Cognition of Complex Thought Patternsby: Harry M. Sneed v. 15 i. 4 p. 481 - 487
- Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithmby: Csaba Faragó, Tamás Gergely v. 15 i. 4 p. 489 - 508
- XML Semantics Extensionby: Ferenc Havasi v. 15 i. 4 p. 509 - 528
- Mathematical models for simulation of continuous grinding process with recirculationby: 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 Diagramsby: Johannes Koskinen, Erkki Mäkinen, Tarja Systä v. 15 i. 4 p. 547 - 565
- A distributed program synthesizerby: Vahur Kotkas v. 15 i. 4 p. 567 - 581
- Automatic Test Selection based on CEFSM Specificationsby: Gábor Kovács, Zoltán Pap, Gyula Csopaki v. 15 i. 4 p. 583 - 599
- Resource-Conscious AI Planning with Conjunctions and Disjunctionsby: Peep Küngas v. 15 i. 4 p. 601 - 620
- Experiences in Modelling Feature Interactions with Coloured Petri Netsby: Louise Lorentsen, Antti-Pekka Tuovinen, Jianli Xu v. 15 i. 4 p. 621 - 632
- Framework for Studying Substitutionby: Härmel Nestra v. 15 i. 4 p. 633 - 652
- Standardized Event Pair Based Test Generation Method Using TSS&TPby: 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 Maisaby: 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 IPv4by: 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 Correlationby: Risto Vaarandi v. 15 i. 4 p. 705 - 723
- On some algebraic properties of automataby: András Ádám v. 15 i. 1 p. 1 - 8
- P Systems with Communication Based on Concentrationby: 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 Languagesby: Pál Dömösi, Satoshi Okawa v. 15 i. 1 p. 25 - 32
- On isomorphic representations of generalized definite automataby: Ferenc Gécseg, Balázs Imreh v. 15 i. 1 p. 33 - 44
- Languages Recognized by a Class of Finite Automataby: Andrei Kelarev, Olga Sokratova v. 15 i. 1 p. 45 - 52
- P Systems with Picture Objectsby: Shankara Narayanan Krishna, Raghavan Rama, Kamala Krithivasan v. 15 i. 1 p. 53 - 74
- Logical definability of Y-tree and trellis systolic omega-languagesby: Angelo Monti, Adriano Peron v. 15 i. 1 p. 75 - 100
- Affine matching of two sets of points in arbitrary dimensionsby: 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 pathsby: Gerhard J. Woeginger, Jiri Sgall v. 15 i. 1 p. 107
- Motion Planning Algorithms for Stratified Kinematic Systems with Application to the Hexapod Robotby: István Harmati, Bálint Kiss v. 15 i. 2
- An online scheduling algorithm for a two-layer multiprocessor architectureby: Csanád Imreh v. 15 i. 2
- Parallelization of an algorithm for the automatic detection of deformable objectsby: 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 Mediaby: Eva M. Ortigosa, Luis F. Romero, J. I. Ramos v. 15 i. 2
- The Debug Slicing of Logic Programsby: Gyöngyi Szilágyi, László Harmath, Tibor Gyimóthy v. 15 i. 2
- Generation and Reconstruction of hv-convex 8-connected Discrete Setsby: Emese Balogh v. 15 i. 2
- SmallSteps: An Adaptive Distance-based Clustering Algorithmby: Gy. Koch, József Dombi v. 15 i. 2
- A 3D Parallel Shrinking Algorithmby: Kálmán Palágyi v. 15 i. 2
- Parallel implementation for large and sparse eigenproblemsby: Ester M. Garzón, Inmaculada García v. 15 i. 2
- Learning Decision Trees in Continuous Spaceby: Józef Dombi, Á. Zsiros v. 15 i. 2
- Sets of integers in different number systems and the Chomsky hierarchyby: István Katsányi v. 15 i. 2
- A Fuzzy Approach for Mining Quantitative Association Rulesby: Attila Gyenesei v. 15 i. 2
- Using Decision Trees to Infer Semantic Functions of Attribute Grammarsby: Szilvia Zvada, Tibor Gyimóthy v. 15 i. 2
- Hybrid Concurrency Control and Recovery for Multi-Level Transactionsby: Klaus-Dieter Schewe, Torsten Ripke, Sven Drechsler v. 14 i. 3 p. 419 - 453
- A Note on Decidability of Reachability for Conditional Petri Netsby: Ferucio Laurentiu Tiplea, Cristina Badarau v. 14 i. 3 p. 455 - 459
- Unusual Algorithms for Lexicographical Enumerationby: Pál Dömösi v. 14 i. 3 p. 461 - 468
- Inferring pure context-free languages from positive databy: Takeshi Koshiba, Erkki Mäkinen, Yuji Takada v. 14 i. 3 p. 469 - 477
- On inferring zero-reversible languagesby: Erkki Mäkinen v. 14 i. 3 p. 479 - 484
- F codesby: Marek Michalik v. 14 i. 3 p. 485 - 489
- Note on the Cardinality of some Sets of Clonesby: Jovanka Pantovic, Dusan Vojvodic v. 14 i. 3 p. 491 - 495
- A Note on the Equivalence of the Set Covering and Process Network Synthesis Problemsby: Balázs Imreh, J. Fülöp, Ferenc Friedler v. 14 i. 3 p. 497 - 501
- Note on the Work Function Algorithmby: Béla Csaba v. 14 i. 3 p. 503 - 506
- Modular Reinforcement Learning: A Case Study in a Robot Domainby: Zsolt Kalmár, Csaba Szepesvári, András Lörincz v. 14 i. 3 p. 507 - 522
- Acts Over Completely O-Simple Semigroupsby: A. Yu. Avdeyev, I. B. Kozhukhov v. 14 i. 4 p. 523 - 531
- The Logic of Knights, Knaves, Normals and Mutesby: L. Aszalós v. 14 i. 4 p. 533 - 540
- Equivalence of Mealy and Moore Automataby: I. Babcsányi v. 14 i. 4 p. 541 - 552
- Pseudo-Hamiltonian Graphsby: Luitpold Babel, Gerhard J. Woeginger v. 14 i. 4 p. 553 - 567
- Two remarks on variants of simple eco-grammar systemsby: Judit Csima v. 14 i. 4 p. 569 - 582
- On Kleene Algebras of Ternary Co-Relationsby: Igor Dolinka v. 14 i. 4 p. 583 - 595
- Results concerning EOL and COL power seriesby: Juha Honkala v. 14 i. 4 p. 597 - 605
- On commutative asynchronous nondeterministic automataby: Balázs Imreh, M. Ito, A. Pukler v. 14 i. 4 p. 607 - 617
- Difference Functions of Dependence Spacesby: Jouni Järvinen v. 14 i. 4 p. 619 - 630
- Elementary decomposition of soliton automataby: Miklós Bartha, Miklós Krész v. 14 i. 4 p. 631 - 652
- Regulated Pushdown Automataby: Alexander Meduna, Dusan Kolar v. 14 i. 4 p. 653 - 664
- 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 Coveringby: János Csirik, J. B. G. Frenk, Martine Labbé, S. Zhang v. 14 i. 1 p. 13 - 26
- On 1-Representations of Integersby: János Demetrovics, Attila Pethö, Lajos Rónyai v. 14 i. 1 p. 27 - 36
- Complete Finite Automata Network Graphs with Minimal Number of Edgesby: Pál Dömösi, Chrystopher L. Nehaniv v. 14 i. 1 p. 37 - 50
- Trips on Treesby: Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal Van Best v. 14 i. 1 p. 51 - 64
- Axiomatizing Iteration Categoriesby: Zoltán Ésik v. 14 i. 1 p. 65 - 82
- On One-Pass Term Rewritingby: 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-Productby: Balázs Imreh, Masami Ito v. 14 i. 1 p. 99 - 104
- Directable Nondeterministic Automataby: Balázs Imreh, Magnus Steinby v. 14 i. 1 p. 105 - 116
- Syntactic Monoids of Codesby: Helmut Jürgensen v. 14 i. 1 p. 117 - 134
- Tree Transducers and Formal Tree Seriesby: Werner Kuich v. 14 i. 1 p. 135 - 164
- Duplication Grammarsby: Carlos Martín-Vide, Gheorghe Paun v. 14 i. 1 p. 151 - 164
- Some Properties of Duplication Grammarsby: Victor Mitrana, Grzegorz Rozenberg v. 14 i. 1 p. 165 - 178
- Watson-Crick Walks and Roads on DOL Graphsby: Arto Salomaa v. 14 i. 1 p. 179 - 192
- Generalized Fairness and Context-Free Languagesby: Kai Salomaa, Sheng Yu v. 14 i. 1 p. 193 - 204
- Preface - Papers from the Conference for PhD Students in Computer Scienceby: Tibor Csendes, Zoltán Fülöp v. 14 i. 2 p. 215 - 216
- On the Partitioning Algorithmby: Béla Csaba v. 14 i. 2 p. 217 - 228
- Test Suite Reduction in Conformance Testingby: Tibor Csöndes, Sarolta Dibuz, Balázs Kotnyek v. 14 i. 2 p. 229 - 238
- A Family of Fast Constant-Space Substring Search Algorithmsby: Harri Hakonen, Timo Raita v. 14 i. 2 p. 239 - 250
- On Merging Reduction of the Process Network Synthesis Problemby: 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 Representationby: Dragan Jankovic v. 14 i. 2 p. 263 - 284
- Object-Oriented Model for Partially Seperable Functions in Parameter Estimationby: Jaakko Järvi v. 14 i. 2 p. 285 - 302
- Hausdorff Dimension of Univoque Setsby: Gábor Kallós v. 14 i. 2 p. 303 - 314
- Optimal Parameters of a Sinusoidal Representation of Signalsby: András Kocsor, László Tóth, I. Bálint v. 14 i. 2 p. 315 - 330
- Improved Greedy Algorithm for Computing Approximate Median Stringsby: Ferenc Kruzslicz v. 14 i. 2 p. 331 - 340
- Limiting Distortion of a Wavelet Image Codecby: Joonas Lehtinen v. 14 i. 2 p. 341 - 356
- On the Exact Solution of the Euclidean Three-Matching Problemby: Gábor Magyar, Mika Johnsson, Olli Nevalainen v. 14 i. 2 p. 357 - 376
- Testing Internet Applications - Terminology and Applicabilityby: Mazen Malek, Roland Gecse v. 14 i. 2 p. 377 - 388
- A Study of Portability in the Deployment of WWWby: András Micsik v. 14 i. 2 p. 389 - 402
- A Parallelized Sequential Random Search Global Optimization Algorithmby: Pilar Martínez Ortigosa, J. Balogh, Inmaculada García v. 14 i. 2 p. 403 - 418
- NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammarsby: Markus Lohrey v. 13 i. 3 p. 209 - 224
- Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammarsby: Alexander Meduna v. 13 i. 3 p. 225 - 242
- Isomorphic Representation of Nondeterministic Nilpotent Automataby: Ildikó Székely v. 13 i. 3 p. 243 - 256
- On the Information Content of Semi-Structured Databasesby: Mark Levene v. 13 i. 3 p. 257 - 276
- Limitations of Rule Triggering Systems for Integrity Maintenance in the Context of Transition Specificationsby: Klaus-Dieter Schewe, Bernhard Thalheim v. 13 i. 3 p. 277 - 304
- Non-Markovian Policies in Sequential Decision Problemsby: Csaba Szepesvári v. 13 i. 3 p. 305 - 318
- On Decision-Mappings Related to Process Network Synthesis Problemby: 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 Problemsby: J. Fülöp, Balázs Imreh, Ferenc Friedler v. 13 i. 3 p. 329 - 338
- Grammars Working on Layered Stringsby: Paolo Bottoni, Giancarlo Mauri, Piero Mussio, Gheorghe Paun v. 13 i. 4 p. 339 - 358
- On Extended Simple Eco-grammar Systemsby: Judit Csima v. 13 i. 4 p. 359 - 374
- Descriptional Complexity of Multi-Continuous Grammarsby: Alexander Meduna v. 13 i. 4 p. 375 - 384
- Decompositions of Automata and Transition Semigroupsby: Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic v. 13 i. 4 p. 385 - 404
- On Minimal and Maximal Clones IIby: László Szabó v. 13 i. 4 p. 405 - 412
- Improving Storage Handling of Interval Methods for Global Optimizationby: A. E. Csallner v. 13 i. 4 p. 413 - 422
- Minimizing the Number of Tardy Jobsby: Günter Rote, Gerhard J. Woeginger v. 13 i. 4 p. 423 - 430
- Generalized Dependencies in Relational Databasesby: Attila Sali Sr., Attila Sali v. 13 i. 4 p. 431 - 438
- Analysis of the Completion Time of Markov Reward Modelsby: Miklós Telek, András Pfening, Gábor Fodor v. 13 i. 4 p. 439
- Regular Expression Star-Freeness is PSPACE-Completeby: L. Bernátsky v. 13 i. 1 p. 1 - 22
- Server Problems and Regular Languagesby: Béla Csaba, G. Dányi v. 13 i. 1 p. 23 - 40
- On alphai-Products of Nondeterministic Tree Automataby: Balázs Imreh v. 13 i. 1 p. 41 - 54
- On Lexicographic Enumeration of Regular and Context-Free Languagesby: Erkki Mäkinen v. 13 i. 1 p. 55 - 62
- Bounded Space On-Line Variable-Sized Bin Packingby: Rainer E. Burkard, Guochuan Zhang v. 13 i. 1 p. 63 - 76
- Generalized Harary Gamesby: András Pluhár v. 13 i. 1 p. 77 - 84
- Evaluation Strategies of Fuzzy Datalogby: Ágnes Achs v. 13 i. 1 p. 85 - 102
- Framework for Generating Object-Oriented Databases from Conceptual Specificationsby: György Kovács, Patrick van Bommel v. 13 i. 2 p. 103 - 140
- CD Grammar Systems and Trajectoriesby: Alexandru Mateescu v. 13 i. 2 p. 141 - 158
- On Hybrid Connectionist-Symbolic Modelsby: Petr Sosík v. 13 i. 2 p. 159 - 172
- Various Communications in PC Grammar Systemsby: György Vaszil v. 13 i. 2 p. 173 - 196
- On Two-Step Methods for Stochastic Differential Equationsby: Rózsa Horváth Bokor v. 13 i. 2 p. 197 - 207
- On Representing RE Languages by One-Sided Internal Contextual Languagesby: Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa v. 12 i. 3 p. 217 - 234
- Growth Functions and Length Sets of Replicating Systemsby: Valeria Mihalache, Arto Salomaa v. 12 i. 3 p. 235 - 248
- The Reflexive Domain of CPO's Idealsby: Gabriel Ciobanu v. 12 i. 3 p. 249 - 260
- On Domain and Range Tree Languages of Superlinear Deterministic Top-down Tree Transformationsby: Gábor Dányi v. 12 i. 3 p. 261 - 278
- On Binary Minimal Clonesby: L. Lévai, P. P. Pálfy v. 12 i. 3 p. 279 - 294
- On a Normal Form of Petri Netsby: Ferucio Laurentiu Tiplea, Masashi Katsura, Masami Ito v. 12 i. 3 p. 295 - 308
- A Note on Connection Between PNS and Set Covering Problemsby: Z. Blázsik, Balázs Imreh v. 12 i. 3 p. 309 - 312
- Steiner Minimum Trees for Equidistant Points on Two Sides of an Angleby: 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 Systemsby: Jürgen Dassow, Victor Mitrana v. 12 i. 4 p. 331 - 346
- On Competence and Completeness in CD Grammar Systemsby: Henning Bordihn, Erzsébet Csuhaj-Varjú v. 12 i. 4 p. 347 - 360
- Accepting Multi-Agent Systems IIby: Henning Fernau, Markus Holzer v. 12 i. 4 p. 361 - 380
- PC Grammar Systems: Recent Results, Open Problemsby: Gheorghe Paun v. 12 i. 4 p. 381 - 396
- PC Grammar Systems with Separated Alphabetsby: Valeria Mihalache v. 12 i. 4 p. 397 - 410
- On Regular Characterizations of Languages by Grammar Systemsby: Lucian Ilie, Arto Salomaa v. 12 i. 4 p. 411 - 426
- Teams in Grammar Systems: Hybridity and Weak Rewritingby: Maurice H. ter Beek v. 12 i. 4 p. 427 - 444
- Test Tube Systems or How to Bake a DNA Cakeby: Rudolf Freund, Franziska Freund v. 12 i. 4 p. 445 - 460
- Natural Language Understanding: a New Challenge for Grammar Systemsby: Carlos Martín-Vide v. 12 i. 4 p. 461 - 472
- Generalised DOL Treesby: Lila Kari, Grzegorz Rozenberg, Arto Salomaa v. 12 i. 1 p. 1 - 10
- On Isomorphic Representation of Nondeterministic Tree Automataby: Balázs Imreh v. 12 i. 1 p. 11 - 22
- Some Remarks on Directable Automataby: Balázs Imreh, Magnus Steinby v. 12 i. 1 p. 23 - 36
- The Optimistic and Cautius Semantics for Inconsistent Knowledge Basesby: John Grant, V. S. Subrahmanian v. 12 i. 1 p. 37 - 56
- Reconstruction of Unique Binary Matrices with Prescribed Elementsby: Attila Kuba v. 12 i. 1 p. 57 - 70
- Demonstration of a Problem-Solving Methodby: 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 Functionby: Zoltán Horváth v. 12 i. 1 p. 83 - 94
- Towards Computer Aided Development of Parallel Compilers Running on Transputer Architectureby: János Toczki v. 12 i. 1 p. 95 - 106
- On Graphs with Perfect Internal Matchingsby: Miklós Bartha, Éva Gombás v. 12 i. 2 p. 111 - 124
- Remarks on the Interval Number of Graphsby: András Pluhár v. 12 i. 2 p. 125 - 130
- Right Group-Type Automataby: I. Babcsányi, A. Nagy v. 12 i. 2 p. 131 - 136
- Some Properties of H-Functionsby: Ivan Mirchev, Borislav Yurukov v. 12 i. 2 p. 137 - 144
- Quasioptimal Bound for the Length of Reset Words for Regular Automataby: I. K. Rystsov v. 12 i. 2 p. 145 - 152
- Fuzzy Extension of Datalogby: Ágnes Achs, Attila Kiss v. 12 i. 2 p. 153 - 166
- Some Remarks On Generating Armstrong And Inferring Functional Dependencies Relationby: János Demetrovics, Vu Duc Thi v. 12 i. 2 p. 167 - 180
- A Lattice View of Functional Dependencies in Incomplete Relationsby: Mark Levene v. 12 i. 2 p. 181 - 208
- On a Tour Construction Heuristic for the Asymmetric TSPby: I. Bartalos, T. Dudás, Balázs Imreh v. 12 i. 2 p. 209 - 216
- Mealy-Automata in Which the Output-Equivalence is a Congruenceby: I. Babcsányi, A. Nagyr v. 11 i. 3 p. 121 - 126
- Measure of Infinitary Codesby: Nguyen Huong Lam, Do Long Van v. 11 i. 3 p. 127 - 138
- A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowingby: Heinz Faßbender, Heiko Vogler v. 11 i. 3 p. 139 - 168
- Radical Theory for Group Semiautomataby: Y. Fong, F. K. Huang, R. Wiegandt v. 11 i. 3 p. 169 - 188
- Structuring Grammar Systems by Priorities and Hierarchiesby: Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg v. 11 i. 3 p. 189 - 204
- Normal Forms and Minimal Keys in the Relational Datamodelby: János Demetrovics, Vu Duc Thi v. 11 i. 3 p. 205 - 216
- On Strong-Generalized Positive Boolean Dependenciesby: Le Thi Thanh v. 11 i. 3 p. 217 - 232
- Partitioning Graphs into Two Treesby: Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao v. 11 i. 3 p. 233 - 240
- Codes and Infinite Wordsby: Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger v. 11 i. 4 p. 241 - 256
- A Note on Regular Strongly Shuffle-Closed Languagesby: Balázs Imreh, A. M. Ito v. 11 i. 4 p. 257 - 260
- A Pumping Lemma for Output Languages of Attributed Tree Transducersby: Armin Kühnemann, Heiko Vogler v. 11 i. 4 p. 261 - 306
- On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditionsby: Alexander Meduna, A. Gopalaratnam v. 11 i. 4 p. 307 - 324
- Invariance Groups of Threshold Functionsby: E. K. Horváth v. 11 i. 4 p. 325 - 332
- On the Complexity of Dynamic Tests for Logic Functionsby: V. A. Vardanian v. 11 i. 4 p. 333 - 344
- Some Remarks on Functional Dependencies in Relational Datamodelsby: Vu Duc Thi, Le Thi Thanh v. 11 i. 4 p. 345 - 352
- A Tourist Guide through Treewidthby: Hans L. Bodlaender v. 11 i. 1-2 p. 1 - 22
- A Lower Bound for On-Line Vector-Packing Algorithmsby: 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 Datamodelby: János Demetrovics, Vu Duc Thi v. 11 i. 1-2 p. 35 - 48
- Fundamental Concepts of Object Oriented Databasesby: Klaus-Dieter Schewe, Bernhard Thalheim v. 11 i. 1-2 p. 49 - 84
- On the Characterization of the Integers: The Hidden Function Problem Revisitedby: Rudolf Berghammer v. 11 i. 1-2 p. 85 - 96
- On Codes of Bi-Infinite Wordsby: 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 Supportby: M. Biró, P. Danyi, P. Gelléri v. 11 i. 1-2 p. 111 - 119
- On the Randomized Complexity of Monotone Graph Propertiesby: Hans Dietmar Gröger v. 10 i. 3 p. 119 - 128
- On the Interaction Between Closure Operations and Choice Functions with Applications to Relational Databaseby: János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik v. 10 i. 3 p. 129 - 140
- Normal Form Relation Schemes: A New Characterizationby: János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik v. 10 i. 3 p. 141 - 164
- Symbiotic EOL Systemsby: Alexander Meduna v. 10 i. 3 p. 165 - 172
- Alternation Bounds for Tree Automataby: Kai Salomaa v. 10 i. 3 p. 173 - 198
- Initial and Final Congruencesby: Virgil Emil Cazanescu, Rodica Ceterchi v. 10 i. 3 p. 199 - 216
- A Note on Intersection of Isotone Clonesby: János Demetrovics, Lajos Rónyai v. 10 i. 3 p. 217 - 220
- A Criterion for the Simplicity of Finite Moore Automataby: András Ádám v. 10 i. 4 p. 221 - 236
- On a Special Composition of Tree Automataby: Balázs Imreh v. 10 i. 4 p. 237 - 242
- Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closureby: Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa v. 10 i. 4 p. 243 - 254
- The Boolean Closure of DR-Recognizable Tree Languagesby: Eija Jurvanen v. 10 i. 4 p. 255 - 272
- A Queuing Model for a Processor-Shared Multi-Terminal System Subject to Breakdownsby: B. Almási v. 10 i. 4 p. 273 - 282
- The Self-organizing List and Processor Problems under Randomized Policiesby: T. Makjamroen v. 10 i. 4 p. 283 - 302
- Computing Maximum Valued Regionsby: Gerhard J. Woeginger v. 10 i. 4 p. 303 - 316
- On the Boolean Structure of Fuzzy Logical Systems: A Counter Exampleby: József Dombi, Gy. Lencsés v. 10 i. 4 p. 317 - 322
- On Minimal and Maximal Clonesby: László Szabó v. 10 i. 4 p. 323 - 327
- Analysis of the SCAN Service Polling Modelby: Brian D. Bunday v. 10 i. 1-2 p. 1 - 14
- Heuristic for the 0-1 Min-Knapsack Problemby: 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-Packingby: Gábor Galambos v. 10 i. 1-2 p. 21 - 24
- On Strict Codesby: Nguyen Huong Lam, Do Long Van v. 10 i. 1-2 p. 25 - 34
- Free Submonoids and Minimal omega-Generators of Romegaby: Igor Litovsky v. 10 i. 1-2 p. 35 - 44
- Special Families of Matrix Languages and Decidable Problemsby: Alexandru Mateescu v. 10 i. 1-2 p. 45 - 52
- Boolean-Type Retractable Automata with Trapsby: A. Nagy v. 10 i. 1-2 p. 53 - 64
- Language Representations Starting from Fully Initial Languagesby: Gheorghe Paun, Sorina Vicolov v. 10 i. 1-2 p. 65 - 70
- Modelling of Heterogeneous Multiprocessor Systems with Randomly Changing Parametersby: János Sztrik v. 10 i. 1-2 p. 71 - 84
- Modelling of a Communication System Evolving in a Random Environmentby: János Sztrik, L. Lukashuk v. 10 i. 1-2 p. 85 - 92
- Weak Dependencies in the Relational Datamodelby: Vu Duc Thi, N. K. Anh v. 10 i. 1-2 p. 93 - 100
- Covering Morphisms and Unique Minimal D-Schemesby: Ralph Tindell v. 10 i. 1-2 p. 101 - 112
- A Note on Fully Initial Grammarsby: Sorina Vicolov v. 10 i. 1-2 p. 113 - 118
- Towards languages that support program derivation, or control modularity considered harmfulby: Reino Kurki-Suonio v. 9 i. 3 p. 179 - 192
- Techniques for Modular language implementationby: Kai Koskimies v. 9 i. 3 p. 193 - 200
- An error - recovering from of DCGsby: Jukka Paakki, Kori Toppola v. 9 i. 3 p. 212 - 221
- Uniform approach to parameter transmission mechanisms, coercions, optional parameters and patternsby: Matti O. Jokinen v. 9 i. 3 p. 223 - 233
- Generation of test cases for simple prolog programsby: Pekka Kilpeläinen, Heikki Mannila v. 9 i. 3 p. 235 - 246
- A natural language interface based on attribute grammarsby: Zoltán Alexin, József Dombi, Károly Fábricz, Tibor Gyimóthy v. 9 i. 3 p. 247 - 255
- Data pictures on the desktopby: Ágnes Hernádi, A. Heppes, Elöd Knuth v. 9 i. 3 p. 257 - 268
- YYY - A database design toolby: Harri Laine v. 9 i. 3 p. 269 - 280
- Frames for protocal descriptionby: Solly Wagner-Dibuz v. 9 i. 3 p. 281 - 289
- A programming environment for a transputer-based multiprocessor systemby: M. Aspnäs, Ralph-Johan Back v. 9 i. 3 p. 291 - 301
- PICA - A graphical program development toolby: Aimo A. Törn v. 9 i. 3 p. 303 - 321
- MICROTEST - A testing tool on PCby: István Forgács, Attila Horváth, Endre Somos v. 9 i. 3 p. 323 - 332
- Recognizable sets of finite bilabelled transition systemsby: A. Arnold v. 9 i. 4 p. 333 - 347
- A note on axiomatizing flowchart schemesby: Virgil Emil Cazanescu, Gheorghe Stefanescu v. 9 i. 4 p. 349 - 359
- On the multidimensional vector bin packingby: János Csirik, J. B. G. Frenk, Martine Labbé, S. Zhang v. 9 i. 4 p. 361 - 369
- Product hierarchies of automata and homomorphic simulationby: Pál Dömösi, Zoltán Ésik v. 9 i. 4 p. 371 - 373
- A note on the axiomatization of iteration theoriesby: Zoltán Ésik v. 9 i. 4 p. 375 - 384
- Investigation on Armstrong relations, dependency inference, and excluded functional dependenciesby: Georg Gottlob, Leonid Libkin v. 9 i. 4 p. 385 - 402
- The complexity of a counting finite-state automationby: Craig A. Rich, Giora Slutzki v. 9 i. 4 p. 403 - 417
- Decision problems arising from knapsack transformationsby: Arto Salomaa v. 9 i. 4 p. 419 - 440
- Preserving two-tuple dependencies under projectionby: Bernhard Thalheim, E. Al-Fedhagi v. 9 i. 4 p. 441 - 458
- Asymptotic analysis of some controlled finite-source queuing systemsby: V. V. Anisimov, János Sztrik v. 9 i. 1 p. 27 - 38
- A Decomposition Theorem for a class of infinite transformation semigroupsby: Ralph P. Tucci v. 9 i. 1 p. 39 - 54
- Two transformations on attribute grammars improving the complexity of their evaluationby: Éva Gombás, Miklós Bartha v. 9 i. 1 p. 55 - 72
- Key ad superkey for a closure functionby: Le Van Bao, Ho Thuan v. 9 i. 1 p. 73 - 88
- On the worst-case performance of the NkF bin-packing heuristicby: János Csirik, Balázs Imreh v. 9 i. 2 p. 89 - 105
- On the performance of on-line algorithms for partition problemsby: 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)-matricesby: Attila Kuba v. 9 i. 2 p. 121 - 132
- Parallel programming structures and attribute grammarsby: R. Alvarez Gil, Á. Makay v. 9 i. 2 p. 133 - 141
- On fully initial grammars with regulated rewritingby: Alexandru Mateescu, Gheorghe Paun v. 9 i. 2 p. 157 - 165
- On star-product of automataby: Ferenc Gécseg, Balázs Imreh v. 9 i. 2 p. 167 - 172
- On characteristic semigroups of Mealy automataby: Genjiro Tanaka v. 9 i. 2 p. 173 - 177
- Pure languages of regulated rewriting and their codingsby: Jürgen Dassow v. 8 p. 227 - 235
- On state grammarsby: Alexander Meduna, Gy. Horváth v. 8 p. 237 - 245
- A note on the generalized nui-productby: Balázs Imreh v. 8 p. 247 - 252
- On the hiearchy of nui-productby: Pál Dömösi, Zoltán Ésik v. 8 p. 253 - 257
- On ranges of compositions of deterministic root-to-frontier tree transformationsby: 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 domainsby: O. Selesnjew, Bernhard Thalheim v. 8 p. 267 - 271
