%% bibliography BEATCS
%%  refer/tib format  
%%  most recent nr 98 / 101 (missing 99, 100)
%%  edit august 2010
%%  No Tech. Contr. in vol 1, nor in vol 96,97,98.
%%
%%Z Columns: Algorithmic Game Theory
%%Z Columns: Algorithmics
%%Z Columns: Complexity
%%Z Columns: Concurrency
%%Z Columns: Distributed Computing
%%Z Columns: Formal Language Theory
%%Z Columns: Logics in Computer Science
%%Z Columns: Formal Specification
%%Z Columns: Natural Computing
%%Z Columns: Programming Languages
%%Z Technical Contributions
%%
%% ==================================
%% Number 101 June 2010
%T Obituary: Robin Milner (1934-2010) PDF  
%A G. Plotkin
%A C. Stirling
%A M. Tofte  
%A 12-16
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/12/16

%Z Columns: Algorithmic Game Theory
%T One-Round Walks in Linear Congestion Games
%A V. Bil{\`o}
%P 45-63
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/2

%Z Columns: Complexity
%T Researching the Complexity of Boolean Functions with Computers
%A K. Amano
%P 64-91
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/3

%Z Columns: Concurrency
%T Higher-Order Concurrency: Expressiveness and Decidability Results - A Survey
%A J.A. P{\'e}rez
%P 92-124
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/4

%Z Columns: Distributed Computing
%T The Origin of Quorum Systems
%A M. Vukoli{\'c}
%P 125-147
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/5

%Z Columns: Formal Specification
%T Formal Modeling and Analysis of Mobile Ad Hoc Networks and Communication Based Systems using Graph and Net Technologies
%A K. Hoffmann
%P 148-160
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/6

%Z Columns: Logics in Computer Science
%T The Tower-of-Babel Problem, and Security Assessment Sharing
%A A. Blass
%A Y. Gurevich
%A E. Hudis
%P 161-182
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/7

%Z Technical Contributions
%T Using Stochastic Indexed Grammars for RNA Structure Prediction With Pseudoknots 
%A U. Sch{\"o}ning
%A M. von Knop 
%P 185-188
%V 101
%D June 2010
%J |beatcs|
%U http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/view/1

%% ============================================
%A K.R. Apt
%A L.D. Zuck
%T Obituary: Amir Pnueli (1941-2009)
%P 9-
%J |beatcs|
%V 100
%D February 2010

%Z Columns: Algorithmic Game Theory
%T Some Algorithmic Questions About Nash Equilibria
%A M. Mavronikolas
%P 35-
%J |beatcs|
%V 100
%D February 2010

%Z Columns: Complexity
%T Multilinear Polynomials Modulo Composites
%A A. Chattopadhyay
%P 52-
%J |beatcs|
%V 100
%D February 2010

%Z Columns: Concurrency
%T Temporal Logics for Games
%A F. Laroussinie
%P 79-
%J |beatcs|
%V 100
%D February 2010

%Z Columns: Distributed Computing
%T Robust Simulation of Shared Memory: 20 Years After
%A H. Attiya
% 99-
%J |beatcs|
%V 100
%D February 2010

%Z Columns: Logics in Computer Science
%T How to Base Probability Theory on Perfect-Information Games
%A G. Shafer
%A V. Vovk
%A R. Chychyla
%P 115-
%J |beatcs|
%V 100
%D February 2010

%% =====================
%Z Columns: Complexity
%T Progress on Polynomial Identity Testing
%A N. Saxena
%P 49-
%J |beatcs|
%V 99
%D October 2009

%Z Columns: Concurrency
%T Algebraic Properties for Free! 
%A L. Aceto
%A A. Ingolfsdottir
%A M.R. Mousavi
%A M.A. Reniers
%P 81-
%J |beatcs|
%V 99
%D October 2009

%Z Columns: Distributed Computing
%T Composable Error Recovery With Transactional Memory
%A T. Riegel
%A P. Felber
%A C. Fetzer
%P 105-
%J |beatcs|
%V 99
%D October 2009

%Z Columns: Formal Specification
%T Visual Modelling and Analysis of Model Transformations based on Graph Transformation
%A C. Ermel
%P 135-
%J |beatcs|
%V 99
%D October 2009

%Z Columns: Natural Computing
%T Quantum Pseudo-Telepathy Saves the World
%A M. Main
%P 153-
%J |beatcs|
%V 99
%D October 2009

%% ============================================
%Z Columns: Algorithmics
%T Algorithms Aspects of the Consecutive-Ones Property
%A M. Dom
%P 27-
%V 98
%D June 2009
%J |beatcs|

%Z Columns: Algorithmic Game Theory
%T Recents Advances in Approximability of Bimatrix Nash
%A S. Kontogiannis
%A P. Spirakis
%A H. Tsaknakis
%P 80-
%V 98
%D June 2009
%J |beatcs|

%Z Columns: Complexity
%T Integer Multiplication and the Complexity of Binary Decision Diagrams
%A B. Bollig
%P 78-
%V 98
%D June 2009
%J |beatcs|

%Z Columns: Concurrency
%T Deriving Labelled Transition Systems - A Structural Approach
%A J. Rathke
%A P. Soboci{\'n}ski
%P 107-
%V 98
%D June 2009
%J |beatcs|

%Z Columns: Distributed Computing
%T Transactional Memory: A Primer for Theorists
%A M. Herlihy
%P 123-
%V 98
%D June 2009
%J |beatcs|

%Z Columns: Formal Specification
%T Cospan DPO Approach: An Alternative for DPO Graph Transformations
%A H. Ehrig
%A F. Hermann
%A U. Prange
%P 139-
%V 98
%D June 2009
%J |beatcs|

%Z Columns: Logics in Computer Science
%T The Logics of Infons
%A Y. Gurevich
%A I. Neeman
%P 150-
%V 98
%D June 2009
%J |beatcs|

%% ============================================
%Z Columns: Algorithmic Game Theory
%T Mechanism Design for Scheduling
%A G. Christodoulou
%A E. Koutsoupias 
%P 39-
%V 97
%D February 2009
%J |beatcs|

%Z Columns: Concurrency
%T The Complexity of Planar Graph Isomorphism 
%A J. Tor{\'a}n
%A F. Wagner 
%P 60-
%V 97
%D February 2009
%J |beatcs|

%Z Columns: Distributed Computing
%T The Theory of Transactional Memory
%A R. Guerraoui
%A M. Kapaka
%P 83-
%V 97
%D February 2009
%J |beatcs|

%Z Columns: Formal Specification
%T Graph Abstraction for a Modal Logic
%A I. Boneva
%A J. Kreike
%A M. Kurb{\'a}n
%A A. Rensik
%P 106-
%V 97
%D February 2009
%J |beatcs|

%T Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation
%A H. Ehrig
%A C. Ermel
%A F. Hermann
%A B. K{\"o}nig
%P 117-
%V 97
%D February 2009
%J |beatcs|

%Z Columns: Logics in Computer Science
%T Fixed Point Theorem and Aperiodic Tilings
%A B. Durand
%A A. Romashchenko
%A A. Shen
%P 126-
%V 97
%D February 2009
%J |beatcs|

%Z Columns: Natural Computing
%T Physical Experiments as Oracles
%A E. Beggs 
%A J.F Costa
%A V. Tucker 
%P 137-
%V 97
%D February 2009
%J |beatcs|

%Z Miscellaneous
%T Evolution of mutating software
%A G.J. Chaitin 
%P 157-
%V 97
%D February 2009
%J |beatcs|

%%============================================
%Z Columns: Algorithmics
%A F. Fisenbrand
%P 45-
%T Algorithmics for integer programming
%V 96
%D October 2008
%J |beatcs|

%Z Columns: Concurrency
%A D. Miller
%T Formalizing operational semantic specifications in logic
%P 58-
%V 96
%D October 2008
%J |beatcs|

%Z Columns: Distributed Computing
%A G. Taubenfeld
%T Shared memory synchronization
%P 80-
%V 96
%D October 2008
%J |beatcs|

%Z Columns: Natural Computing
%A D. Corne
%A A. reynolds
%T Swarm intelligence: A tutorial account
%P 104-
%V 96
%D October 2008
%J |beatcs|

%% ============================================
%Z Columns: Algorithmics
%T Precedence constraint scheduling and connections to
   dimension theory of partial orders
%A C. Amb{\"u}hl
%A M. Mastrolilli
%A N. Mutsanas
%A O. Svensson
%P 37-
%V 95
%D June 2008
%J |beatcs|

%Z Columns: Complexity
%T Communication lower bounds using dual polynomials
%A A. Sherstov 
%P 59-
%V 95
%D June 2008
%J |beatcs|

%Z Columns: Concurrency
%T 20 Years of modal and mixed specifications 
%A A. Antonik
%A M. Huth
%A K.G. Larsen 
%A U. Nyman
%A A. Wasowski
%P 94-
%V 95
%D June 2008
%J |beatcs|

%Z Columns: Distributed Computing
%T Algorithms for overlay networks 
%A C. Scheideler
%P 130-
%V 95
%D June 2008
%J |beatcs|

%Z Columns: Formal Specification
%T Process definition using subobject transformation systems
%A F. Hermann
%A H. Ehrig
%P 153-
%V 95
%D June 2008
%J |beatcs|

%Z Columns: Logics in Computer Science
%T Two forms of one useful logic: existential fixed point
   logic and liberal datalog
%A A. Blass and 
%A Y. Gurevich
%P 164-
%V 95
%D June 2008
%J |beatcs|

%Z Columns: Natural Computing
%T Combinatorics of conservation laws
%A J. Kari
%A S. Taati
%P 183-
%V 95
%D June 2008
%J |beatcs|

%Z Technical Contributions
%T The Freudenthal problem and its ramifications (part III)
%A A. Borne
%A C.A.J. Hurkens
%A G.J. Woeginger
%P 201-
%V 95
%D June 2008
%J |beatcs|

%Z Technical Contributions
%T On the existence of a finite base for complete trace
   equivalence over bpa with interrupt
%A L. Aceto
%A S. Capobianco
%A A. Ing{\'o}lfsd{\'o}ttir
%V 95
%D June 2008
%J |beatcs|
%P 220-

%Z Technical Contributions
%T Avoiding sufficiently large binary patterns
%A N. Rampersad 
%P 241-
%V 95
%D June 2008
%J |beatcs|

%%============================================
%Z Columns: Complexity
%A N. Vereshchagin
%T Kolmogorov complexity and games
%P 43-75
%V 94
%D February 2008
%J |beatcs|

%Z Columns: Concurrency
%T Dynamic spatial logics: a tutorial survey 
%A L. Caires
%P 76-
%V 94
%D February 2008
%J |beatcs|

%Z Columns: Concurrency
%T Applying concurrency research in industry - report on a strategic workshop 
%A L. Aceto
%A J. Baeten
%A W. Fokkin
%A A. Ingolfsdottir
%A U. Nestmann
%P 113-
%V 94
%D February 2008
%J |beatcs|

%Z Columns: Distributed Computing
%T Self-stabilization from theory to practice
%A O. Brukman
%A S. Dolev
%A Y. Haviv
%A L. Lahiani
%A R. Kat
%A E.M. Schiller
%A N. Tzachar
%A R. Yagel
%P 130-
%V 94
%D February 2008
%J |beatcs|

%Z Columns: Formal Specification
%T Flattening of generalized algebraic high-level nets
%A H. Erhig
%A U. Prange
%P 151-
%V 94
%D February 2008
%J |beatcs|

%Z Columns: Formal Specification
%T Style-based architectural reconfigurations
%A R. Bruni
%A A. Lluch Lafuente
%A U. Montanari
%P 161-
%V 94
%D February 2008
%J |beatcs|

%Z Columns: Logics in Computer Science
%T Open questions in the theory of automatic structures
%A B. Khoussainov and 
%A A. Nerode
%P 181-
%V 94
%D February 2008
%J |beatcs|

%Z Technical Contributions
%T Four non-deterministic programming exercises
%A G.J. Woeginger
%P 207-
%V 94
%D February 2008
%J |beatcs|

%Z Technical Contributions
%T Are there natural problems with speedup? 
%A H. Monroe
%P 212-
%V 94
%D February 2008
%J |beatcs|

%%============================================
%Z Columns: Complexity
%T Quantum computing and the hunt for hidden symmetry
%A G. Alagic
%A A. Russell
%P 53-
%V 93
%D October 2007
%J |beatcs|

%Z Columns: Concurrency
%T Dynamic web data and process calculi 
%A S. Maffeis
%P 76-
%V 93
%D October 2007
%J |beatcs|

%Z Columns: Distributed Computing
%T An introduction to population protocols
%A J. Aspnes
%A E. Ruppert
%P 98-
%V 93
%D October 2007
%J |beatcs|

%Z Columns: Formal Language Theory
%T Decision algorithms for subfamilies of regular languages using state-pair graphs
%A Y.-S. Han
%V 93
%D October 2007
%J |beatcs|
%P 118-

%Z Columns: Formal Specification
%T Model transformations by graph transformations are functors
%A H. Ehrig
%A K. Ehrig
%A C. Ermel
%A U. Prange
%P 134-
%V 93
%D October 2007
%J |beatcs|

%Z Columns: Logics in Computer Science
%T Proof interpretations and the computational content of proofs in mathematics
%A U. Kohlenbach
%P 143-
%V 93
%D October 2007
%J |beatcs|

%Z Columns: Natural Computing
%T Machines of systems biology
%A L. Cardelli
%P 176-
%V 93
%D October 2007
%J |beatcs|

%Z Technical Contributions
%T A simple completeness proof for the axiomatisations of weak behavioural equivalences
%A Y. Deng
%P 207-
%V 93
%D October 2007
%J |beatcs|

%Z Technical Contributions
%T The domino problem of the hyperboiic plane is undecidable
%A M. Margenstern
%P 220-
%V 93
%D October 2007
%J |beatcs|

%%============================================
%A B. Speckmann
%T Algorithmic aspects of cartogram computation
%P 33-43
%V 92
%D June 2007
%J |beatcs|

%Z Columns: Concurrency
%A O. Kupferman
%T Exponential gaps in out knowledge
%P 44-64
%V 92
%D June 2007
%J |beatcs|

%Z Columns: Formal Language Theory
%A S. Yu
%T Cover automata for finite languages
%P 65-74
%V 92
%D June 2007
%J |beatcs|

%Z Columns: Formal Specification
%A O. Diaz
%A H. Ehrig
%A C. Ermel
%A U. Prange
%A G. Taentzer
%T Model transformation should be functors
%P 75-81
%V 92
%D June 2007
%J |beatcs|

%Z Columns: Logics in Computer Science
%A A. Blass
%A Y. Gurevich
%T Background of computation
%P 82-114
%V 92
%D June 2007
%J |beatcs|

%Z Columns: Natural Computing
%A M. Hirvensalo
%T EPR Paradox and Bell inequalities
%P 115-139
%V 92
%D June 2007
%J |beatcs|

%Z Technical Contributions
%A G. Richomme
%T Sudo-Lyndon
%P 143-149
%V 92
%D June 2007
%J |beatcs|

%Z Technical Contributions
%A C.A. Furia
%A M. Rossi
%T No need to be strict: On the expressiveness of metric
   temporal logics with (non-)strict operators
%P 150-160
%V 92
%D June 2007
%J |beatcs|

%%============================================
%Z Columns: Algorithmics
%A R. Veltkamp
%T A bit of multimedia retrieval algorithms
%P 29
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Complexity
%A M. Mahajan
%T Polynomial size log depth circuits: between NC1 and AC1
%P 42
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Concurrency
%A L. Aceto
%A A. Ingolfsdottir
%T Characteristic formulae: from automata to logic
%P 57
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Distributed Computing
%A B. Englert
%T OPODIS 2006 report
%P 76
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Formal Language Theory
%T Nine open problems on conjunctive and boolean grammars
%A A. Okhotin
%P 96
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Logics in Computer Science
%T Zero-one laws: thesauri and parametric conditions
%A A. Blass
%A Y. Gurevich
%P 125
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Formal Specification
%T Formal modelling and analysis of flexible processes in
   mobile ad-hoc networks
%A J. Padberg
%A H. Ehrig
%A K. Hoffman
%P 120
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Natural Computing
%T Spiking neural P systems: a tutorial
%A G. Paun
%P 145
%V 91
%D February 2007
%J |beatcs|

%Z Columns: Programming Languages
%T Web services, mobile processes and types
%A K. Honda
%A N. Yoshida
%A M. Carbone
%P 160-
%V 91
%D February 2007
%J |beatcs|

%Z Technical Contributions
%T The Freudenthal Problem and its Ramifications (Part II)
%A A. Born
%A C.A.J. Hurkens
%A G.J. Woeginger
%P 189
%V 91
%D February 2007
%J |beatcs|

%Z Technical Contributions
%T On maximal prefix codes
%A L. Staiger
%P 205
%V 91
%D February 2007
%J |beatcs|

%Z Technical Contributions
%T Relabeling and the independence theorem in the double-pushout
   approach to graph transformations
%P 208
%V 91
%D February 2007
%J |beatcs|

%Z Obituary
%T Peter L. Hammer (1936-2006)
%A E. Boros
%A Y. Crama
%A B. Simeone
%P 227
%V 91
%D February 2007
%J |beatcs|

%Z Miscellaneous
%T Speculations on biology, information and complexity
%A G.J. Chaitin
%P 231
%V 91
%D February 2007
%J |beatcs|

%%============================================
%Z Columns: Algorithmics
%T Some problems around travelling salesmen, dart boards, and Euro-coins
%A V.G. Deineko
%A G. Woeginger
%P 43-52
%V 90
%D October 2006
%J |beatcs|

%Z Columns: Complexity
%T Iterative Decoding of Low-Density Parity Check Codes
%A V. Guruswami
%P 53-88
%V 90
%D October 2006
%J |beatcs|

%Z Columns: Concurrency
%T New Perspectives on Fairness
%A D. Varacca
%A H. V{\"o}lzer
%P 90-108
%V 90
%D October 2006
%J |beatcs|

%Z Columns: Distributed Computing
%T Eight Open Problems in Distributed Computing
%A J. Aspnes
%A C. Bush
%A S. Dolev
%A P. Fatouroum
%A C. Georgiou
%A A. Shvartsman
%A P. Spirakis
%A R. Wattenhofer
%P 109-125
%V 90
%D October 2006
%J |beatcs|

%Z Columns: Formal Language Theory
%T The ultimate equivalence problem for uniform HDT0L systems
%A J. Honkala
%P 127-130
%V 90
%D October 2006
%J |beatcs|

%Z Columns: Formal Specification
%T Review of Dines Bj{\o}rner's textbooks Software Engineering 1-3
%A H. Ehrig
%P 131-133
%V 90
%D October 2006
%J |beatcs|

%Z Columns: Logics in Computer Science
%T Embedded Finite Models
%A L. Libkin
%V 90
%D October 2006
%J |beatcs|
%P 134-149

%Z Columns: Natural Computing
%T Z. Pawlak - a Precursor of DNA Computing and of Picture Grammars
%A S. Marcus
%P 150-154
%V 90
%D October 2006
%J |beatcs|

%Z Columns: Programming Languages
%T Languages for Concurrency
%A C. Palamidessi
%A F. Valencia
%P 155-171
%V 90
%D October 2006
%J |beatcs|

%Z Technical Contributions
%T The Freudenthal Problem and its Ramifications (Part I)
%A A. Born
%A C.A.J. Hurkens
%A G.J. Woeginger
%P 175-191
%V 90
%D October 2006
%J |beatcs|

%Z Technical Contributions
%T Subproblems and NP-Completeness Theory
%A L. Sek Su
%P 192-198
%V 90
%D October 2006
%J |beatcs|

%Z Obituary
%T Joseph Goguen (1941-2006)
%A K. Futatsugi
%A J.-P. Jouannaud
%A J. Meseguer
%V 90
%D October 2006
%J |beatcs|
%P 199-201

%Z Obituary
%T Zdzislaw Pawlak (1926-2006)
%A A. Ehrenfeucht
%A J.F. Peters
%A G. Rozenberg
%A A. Skowron
%P 202-204
%V 90
%D October 2006
%J |beatcs|

%%============================================
%%
%%
%Z Columns: Algorithmics
%T Sublinear-Time Algorithms
%A A. Czumaj
%A C. Sohler
%P 23
%V 89
%D June 2006
%J |beatcs|

%Z Columns: Complexity
%T Learning Boolean Functions under the Uniform Distribution via the Fourier Transform
%A J. K{\"o}bler
%A W. Lindner
%P 48
%V 89
%D June 2006
%J |beatcs|

%Z Columns: Concurrency
%T On the Control of Timed and Hybrid Systems
%A P. Bouyer
%A F. Chevalier
%P 79
%V 89
%D June 2006
%J |beatcs|

%Z Columns: Distributed Computing
%T A Game on a Distributed Network
%A V. Papadopoulou
%P 97
%V 89
%D June 2006
%J |beatcs|

%Z Columns: Formal Language Theory
%T Enumeration of Formal Languages
%A M. Domaratzki
%P 117
%V 89
%D June 2006
%J |beatcs|

%Z Columns: Formal Specification
%T Report on ACCAT Workshop at ETAPS 2006
%A H. Ehrig
%P 134
%V 89
%D June 2006
%J |beatcs|

%Z Columns: Logic in Computer Science
%T Henkin Quantifiers: Logic, Games, and Computation
%A M. Sevenster
%P 136
%V 89
%D June 2006
%J |beatcs|

%Z Technical Contributions
%T Relations over Words and Logic: a Chronology
%A C. Choffrut
%P 159
%V 89
%D June 2006
%J |beatcs|

%Z Technical Contributions
%T Binary Words with Few Squares
%A T. Harju
%A D. Nowotka
%P 164 
%V 89
%D June 2006
%J |beatcs|

%Z Technical Contributions
%T Fine and Wilf's Theorem for Abelian Periods
%A S. Constantinescu
%A L. Ilie
%P 167
%V 89
%D June 2006
%J |beatcs|

%Z Technical Contributions
%T Recursion Theorems and Self-Replication via Text Register Machine Programs
%A L. Moss
%P 171
%V 89
%D June 2006
%J |beatcs|

%%============================================
%%
%%
%Z Columns: Computational Complexity
%T Bridges between algebraic automata theory and complexity theory
%A P. Tesson
%A D. Thérien
%P 37-64
%V 88
%D February 2006
%J |beatcs|

%Z Columns: Concurrency
%T What is algebraic in process theory?
%A B. Luttik
%P 66-83
%V 88
%D February 2006
%J |beatcs|

%Z Columns: Distributed Computing
%T A report from DISC2005, the 19th international symposium 
    on distributed computing
%A M.J. Blesa
%A C. Georgiou
%P 84-103
%V 88
%D February 2006
%J |beatcs|

%Z Columns: Formal Language Theory
%T A short survey on Watson-Crick Automata
%A E. Czeizler
%A E. Czeizler
%P 104-119
%V 88
%D February 2006
%J |beatcs|

%Z Columns: Formal Specification
%T Footprints of HR in initial algebra and final coalgebra
%A H. Ehrig
%V 88
%D February 2006
%J |beatcs|
%P 120-125

%Z Columns: Logic in Computer Science
%T Navigation in XML trees
%A M. Marx
%P 126-140
%V 88
%D February 2006
%J |beatcs|

%Z Columns: Natural Computing
%A N. Jonoska
%T Biomolecular Automata
%P 141-166
%V 88
%D February 2006
%J |beatcs|

%Z Technical Contributions
%A M. Rigo
%A L. Waxweiler
%T A note on syndeticity, recognizable sets, and Cobham's theorem
%P 169-173
%V 88
%D February 2006
%J |beatcs|

%Z Technical Contributions
%T Contextual insertion for #3SAT
%A G. Subramaniam
%A R. Siromoney
%P 174-181
%V 88
%D February 2006
%J |beatcs|

%Z Technical Contributions
%A O. Finkel
%T On the shuffle of regular timed languages
%P 182-184
%V 88
%D February 2006
%J |beatcs|

%%============================================
%Z Columns: Algorithmics
%A Fedor V. Fomin
%A Fabrizio Grandoni
%A Dieter Kratsch 
%T Some New Techniques in Design and Analysis of 
   Exact (Exponential) Algorithms
%P 47-77 
%V 87
%D October 2005
%J |beatcs|

%Z Columns: Complexity
%A Peter Høyer
%A Robert Spalek
%T Lower Bounds on Quantum Query Complexity
%P 78-103
%V 87
%D October 2005
%J |beatcs|

%Z Columns: Concurrency
%A Catuscia Palamidessi
%T Recursion vs Replication in Process Calculi: Expressiveness
%P 105-125
%V 87
%D October 2005
%J |beatcs|

%Z Columns: Formal Specification
%A Barbara K{\"o}nig
%A Vitali Kozioura
%T Augur - A Tool for the Analysis of Graph Transformation Systems
%P 126-137
%V 87
%D October 2005
%J |beatcs|

%Z Columns: Formal Specification
%A Julia Padberg
%T Integration of the Generic Component Concepts for 
   System Modeling with Adhesive HLR Systems
%P 138-154
%V 87
%D October 2005
%J |beatcs|

%Z Columns: Logic in Computer Science
%A Jan Van-den-Bussche
%T First-order Topology Properties
%P 155-164
%V 87
%D October 2005
%J |beatcs|

%Z Columns: Natural Computing
%A Yasubumi Sakakibara
%T Development of a Bacteria Computer: 
   From in silico Finite Automata to in vitro and in vivo. 
%V 87
%D October 2005
%J |beatcs|
%P 165-178

%Z Technical Contributions
%A Pedro Garc{\'i}a
%A Manuel Vázquez-de-Parga
%T A note about mergible states in large NFA. 
%P 181-184
%V 87
%D October 2005
%J |beatcs|

%Z Technical Contributions
%A Olivier Finkel
%T On Decision Problems for Timed Automata
%P 185-190
%V 87
%D October 2005
%J |beatcs|

%Z Technical Contributions
%A P{\'a}l D{\"o}m{\"o}si
%A G{\'e}za Horv{\'a}th
%T The Language of Primitive Words in not Regular: Two Simple Proofs
%P 191-194
%V 87
%D October 2005
%J |beatcs|

%%============HIER KOMT 86
%Z Columns: Algorithmics
%T Parameterized complexity for graph layout problems
%A M. Serna 
%A D.M. Thilikos
%P 41-
%V 86
%D June 2005
%J |beatcs|

%Z Columns: Complexity
%T Isomorphism testing: Perspective and open problems
%A V. Arvind
%A J. Torán
%P 66-
%V 86
%D June 2005
%J |beatcs|

%Z Columns: Distributed Computing
%T Hardness results for cake cutting
%A C. Busch
%A M.S. Krishnamoorthy
%A M. Magdon-Ismail
%P 85-
%V 86
%D June 2005
%J |beatcs|

%Z Columns: Formal Language Theory
%T More words on trajectories
%A M. Domaratzki
%P 107-
%V 86
%D June 2005
%J |beatcs|

%Z Columns: Formal Specification
%T TAPSOFT 2005 - Past and future
%A H. Ehrig
%A B. Mahr
%P 146-
%V 86
%D June 2005
%J |beatcs|

%Z Columns: Logic in Computer Science
%T Explicit graphs with extension properties
%A A. Blass
%A B. Rossman
%P 166-
%V 86
%D June 2005
%J |beatcs|

%Z Columns: Programming Languages 
%T Quantum programming languages - Survey and bibliography
%A S. Gay
%P 176-
%V 86
%D June 2005
%J |beatcs|

%Z Technical Contributions
%T Optimizing sorting and duplicate elimination in XQUERY path expressions
%A J. Hidders
%A P. Michiels
%A R. Vercammen
%P 199-
%V 86
%D June 2005
%J |beatcs|

%Z Technical Contributions
%T Representation of regular languages by equality sets
%A V. Halava
%A T. Harju
%A M. Latteux
%P 224-
%V 86
%D June 2005
%J |beatcs|

%Z Obituary
%T Seymour Ginsburg (1928-2004) An Obituary
%A G. Rozenberg
%A A. Salomaa
%P 234-235
%V 86
%D June 2005
%J |beatcs|

%%============HIER KOMT 85
%Z Columns: Computational Complexity
%T A Post's Program for Complexity Theory
%A H. Buhrman
%A L. Torenvliet
%P 41-51
%V 85
%D February 2005
%J |beatcs|

%Z Columns: Concurrency
%T Process Calculi in a Biological Context
%A D. Prandi
%A C. Priami
%A P. Quanglia
%P 53-69
%V 85
%D February 2005
%J |beatcs|

%Z Columns: Distributed Computing
%T An Application of the Monotone Linearizability Lemma
%A C. Busch
%A M. Mavronicolas
%A P. Spirakis
%P 71-80
%V 85
%D February 2005
%J |beatcs|

%Z Columns: Formal Language Theory
%T Simple language Equations
%A M. Kunc
%P 81-102
%V 85
%D February 2005
%J |beatcs|
 
%Z Columns: Formal Specification
%%T Report on ICGT 2004,
%%    2nd International Conference on Graphs Transformation
%%%P 103-
%A J. Chalopin
%A Y. Metivier
%A W. Zielonka
%T Local Computation in Graphs:
   The Case of Cellular Edge Local Computations
   (Short Summary)
%P 105-109
%V 85
%D February 2005
%J |beatcs|

%Z Columns: Logic in Computer Science
%T A {SAT} Solver Primer
%A D.G. Mitchell
%P 112-133
%V 85
%D February 2005
%J |beatcs|

%Z Columns: Natural Computing
%A G. Rozenberg
%T Computer Science, Informatics, and Natural Computing
%P 133-134
%V 85
%D February 2005
%J |beatcs|

%Z Columns: Natural Computing
%T An Appealing Computational Mechanism Drawn from Bacterial Quorum Sensing
%A N. Krasnogor
%A M. Gheorghe
%A G. Terrazas
%A S. Diggle
%A P. Williams
%A M. Camara
%P 135-148
%V 85
%D February 2005
%J |beatcs|

%Z Technical Contributions
%A S.U. Khan
%A I. Ahmad
%T Combinatorial Pawn Power
%P 151-164
%V 85
%D February 2005
%J |beatcs|

%Z Technical Contributions
%A M. Baena-Garcia
%A R. Morales-Bueno
%A J.L. P\'erez-de-la-Cruz
%A I. Fortes-Ruiz
%A L. Mora-L\'opez
%T Busy Beaver Function in LOOP
%P 165-178
%V 85
%D February 2005
%J |beatcs|

%Z Miscellaneous
%T What Lies Beyond the Mountains
%A J.F. Costa
%A J. Mycka
%P 179-
%V 85
%D February 2005
%J |beatcs|

%Z Columns: Algorithmics
%A M. Gatto
%A R. Jacob
%A L. Peeters
%A B. Weber
%A P. Widmayer
%T Theory on the Tracks:
   A Selection of Railway Optimization Problems
%P 41-70
%V 84
%D October 2004
%J |beatcs|

%Z Columns: Computational Complexity
%T Parametrized Complexity and Subexponential Time
%A J. Flum
%A M. Grohe
%P 71-100
%V 84
%D October 2004
%J |beatcs|

%Z Columns: Concurrency
%T Process Congruences from Reaction Rules
%A P. Soboci\'nski
%P 102-127
%V 84
%D October 2004
%J |beatcs|

%Z Columns: Formal Language Theory
%T Quasiperiodic Infinite Words:
   Some Answers
%A F. Lev\'e
%A G. Richomme
%P 128-138
%V 84
%D October 2004
%J |beatcs|

%Z Columns: Logic in Computer Science
%T Why Sets?
%A A. Blass
%A Y. Gurevich
%P 139-156
%V 84
%D October 2004
%J |beatcs|

%Z Technical Contributions
%T Some Preliminary Results on Three Combinatorial Board Games
%A S.U. Kahn
%A I. Ahmad
%P 159-166
%V 84
%D October 2004
%J |beatcs|

%Z Technical Contributions
%T Passages of Proof
%A C.S. Calude
%A E. Calude
%A S. Marcus
%P 167-188
%V 84
%D October 2004
%J |beatcs|

%Z Technical Contributions
%T Monotone Algebras, R-Trivial Monoids and a Variety of Tree Languages
%A V. Piirainen
%P 189-194
%V 84
%D October 2004
%J |beatcs|

%Z Technical Contributions
%T Inexpensive Linear-Optical Implementations of Deutsch's Algorithm
%A M. Stay
%P 195-200
%V 84
%D October 2004
%J |beatcs|

%Z Columns: Algorithmics
%T Algorithms for Memory Hierarchies
%A P. Sanders
%P 67-85
%V 83
%D June 2004
%J |beatcs|

%Z Columns: Computational Complexity
%T Space and Width in Propositional Resolution
%A J. Tor\'an
%P 86-104
%V 83
%D June 2004
%J |beatcs|

%Z Columns: Concurrency
%T Challenges in Timed Languages:
   from applied theory to basic theory
%A E. Asarin
%P 106-120
%V 83
%D June 2004
%J |beatcs|
%U http://www.cs.auc.dk/\~luca/BEATCS/timedchall.pdf

%Z Columns: Distributed Computing
%T Locality-Aware Network Solutions (A survey)
%A D. Malkhi
%P 121-138
%V 83
%D June 2004
%J |beatcs|

%Z Columns: Formal Language Theory
%T Regular Languages, Sizes of Syntactic Monoids, Graph Colouring,
   State Complexity Results, and How These Topics are Related to
   Each Other
%A M. Holzer
%A B. K\"onig
%P 139-155
%V 83
%D June 2004
%J |beatcs|

%Z Columns: Formal Specification
%A H. Ehrig
%T Integration of Specification Techniques for Applications in
   Engineering 1998-2004
%P 156-158
%V 83
%D June 2004
%J |beatcs|

%Z Columns: Natural Computing 
%A G. Paun
%T Membrane Computing
   after the Second Brainstorming Week Sevilla, Februari 2004
%P 159-170
%V 83
%D June 2004
%J |beatcs|

%Z Technical Contributions
%A L. Kari
%A P. Sos\'ik
%T On Language Equations with Deletion
%P 173-180
%V 83
%D June 2004
%J |beatcs|

%Z Technical Contributions
%A I. Kats\'anyi
%T A Note on Restricted Insertion-Deletion Systems
%P 181-185
%V 83
%D June 2004
%J |beatcs|

%Z Technical Contributions
%A J.M. Sempere
%T A Representation Theorem for Languages Accepted by Watson-Crick
   Finite Automata
%P 187-191
%V 83
%D June 2004
%J |beatcs|

%Z Technical Contributions
%T A Note on Minimal Cover-Automata for Finite Languages
%A P. Garc\'ia
%A J. Ruiz
%V 83
%D June 2004
%J |beatcs|
%P 193-199

%Z Miscellaneous  
%T XXX Years of SOFSEM
%A J. Wiedermann
%P 201-208
%V 83
%D June 2004
%J |beatcs|

%Z Columns: Algorithmics
%T Worst-Case Upper Bounds for kSAT
%A K. Iwama
%P 61-71
%V 82
%D February 2004
%J |beatcs|

%Z Columns: Computational Complexity
%T A Survey on Private Information Retrieval
%A W. Gasarch
%P 72-107
%V 82
%D February 2004
%J |beatcs|
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column82.pdf

%Z Columns: Concurrency
%T Process Algebra Needs Proof Methodology
%A W. Fokkink
%A J.F. Groote
%A M. Reners
%P 109-125
%V 82
%D February 2004
%J |beatcs|
%U http://www.cs.auc.dk/\~luca/BEATCS/colConc82.pdf

%Z Columns: Distributed Computing
%A S. Nikoletsas
%A P. Spirakis
%T The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks
%P 126-169
%V 82
%D February 2004
%J |beatcs|

%Z Columns: Formal Language Theory
%A S. Marcus
%T Quasiperiodic Infinite Words
%V 82
%D February 2004
%J |beatcs|
%P 170-174

%Z Columns: Formal Specification
%A H. Ehrig
%T Attributed Graphs and Typing:
    Reationshi between Different Representations
%P 175-190
%V 82
%D February 2004
%J |beatcs|

%Z Columns: Logic in Computer Science
%T The Flow of Time into Logic - and Computer Science
%A P. Hasle
%A P. {\O}hrstr{\o}m 
%P 191-226
%V 82
%D February 2004
%J |beatcs|

%Z Columns: Natural Computing 
%A T. Harju
%A I. Petre
%A G. Rozenberg
%T Gene Assembly in Celiates.
   Part I. Molecular Operations
%P 227-241
%V 82
%D February 2004
%J |beatcs|

%Z Columns: Security 
%A J.D. Guttman
%T A New Column: Information Security
%V 82
%D February 2004
%J |beatcs|
%P 242-252

%Z Technical Contributions
%T Integers, Game Trees and some Unknowns
%A S.U. Khan
%P 255-262
%V 82
%D February 2004
%J |beatcs|

%Z Technical Contributions
%A A. Szepietowski
%A M. Targan
%T The Counterfeit Coin Problem
%P 263-268
%V 82
%D February 2004
%J |beatcs|

%Z Technical Contributions
%A S. V\'agv\"olgyi
%T Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite
   Systems
%P 269
%V 82
%D February 2004
%J |beatcs|

%Z Technical Contributions
%A B. Nagy
%T The Languages of SAT and n-SAT over Finitely Many Variables are Regular
%V 82
%D February 2004
%J |beatcs|
%P 286-297

%Z Education Matters
%T Introducing the parallel Random Access Machine
   together with FORTARN 90/95
%A H.J. Schneider
%V 82
%D February 2004
%J |beatcs|

%Z Columns: Algorithmics
%T Selfish Task Allocation
%A E. Koutsoupias
%V 81
%D October 2003
%J |beatcs|
%P 79-88

%Z Columns: Concurrency
%T Some of My favourite Results in Classic Process Algebra
%A L. Aceto
%P 90-108
%V 81
%D October 2003
%J |beatcs|
%U http://www.cs.auc.dk/\~luca/BEATCS/column81.pdf

%Z Columns: Computational Complexity
%A S. Aaronson
%T Is P Versus NP Formally Independent?
%P 109-136
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column81.ps
%V 81
%D October 2003
%J |beatcs|

%Z Columns: Distributed Computing
%A R. Feldmann
%A M. Gairing
%A T. L\"ucking
%A B. Monien
%A M. rode
%T Selfish Routing in Non-Cooperative Networks: A Survey
%P 137-164
%V 81
%D October 2003
%J |beatcs|

%Z Columns: Formal Language Theory
%T Counting (Scattered) Subwords
%A A. Salomaa
%P 165-179
%V 81
%D October 2003
%J |beatcs|

%Z Columns: Formal Specification
%A J. de Lara
%T Meta-Modelling and Graph Transformation for the Simulation of Systems
%P 180-194
%V 81
%D October 2003
%J |beatcs|

%Z Columns: Logic in Computer Science
%T Algoritms: A Quest for Absolute Definitions
%A A. Blass
%A Y. Gurevich
%P 195-225
%V 81
%D October 2003
%J |beatcs|

%Z Columns: Natural Computing 
%A D. Harel
%T A Grand Challenge for Computing:
   towards Full Reactive Modeling of a Muli-Cellular Animal
%P 226-235
%V 81
%D October 2003
%J |beatcs|

%Z Columns: Natural Computing 
%A T. Harju
%A I. Petre
%A G. Rozenberg
%T Gene Assembly in Celiates.
   Part I. Molecular Operations
%P 236-249
%V 81
%D October 2003
%J |beatcs|

%Z Technical Contributions
%T Plays, Values, Analysis and the Complexity of Chinese Chess
%A S.U. Khan
%P 253-263
%V 81
%D October 2003
%J |beatcs|

%Z Technical Contributions
%T The Computational Power of Compiling C++
%A M. B\"ohme
%A B. Manthey
%P 164-270
%V 81
%D October 2003
%J |beatcs|

%Z Technical Contributions
%T A Note on First Order Unification
%A R. Readi Nasser
%P 271-278
%V 81
%D October 2003
%J |beatcs|

%Z Technical Contributions
%T Beyond Turing Machines
%A E. Eberbach
%A P. Wegner
%P 279-304
%V 81
%D October 2003
%J |beatcs|

%Z Technical Contributions
%T Building Reliable Systems from Unreliable Components and the DNA
   Computing Paradigm
%A E. Losseva
%P 305-317
%V 81
%D October 2003
%J |beatcs|

%Z Columns: Algorithmics
%T Analysis of Algorithms (AofA) Part II: 1998--2000 
  (``Princeton--Barcelona--Gda\'nsk'')
%A W. Szpankowski
%P 61-
%V 80
%D June 2003
%J |beatcs|

%Z Columns: Formal Specification
%T Net Transformations for Petri Net Technology 
%A M. Urb\'a\v{s}ek
%P 77-
%V 80
%D June 2003
%J |beatcs|

%Z Columns: Computational Complexity
%T A Short History of Computational Complexity 
%A L. Fortnow 
%A S. Homer
%P 95-
%V 80
%D June 2003
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column80.ps
%J |beatcs|

%Z Columns: Natural Computing 
%T Quantum Computation explained to my Mother
%A P. Arrighi
%P 134-
%V 80
%D June 2003
%J |beatcs|

%Z Columns: Formal Language Theory
%T The DF0L language equivalence problem
%A J. Honkala
%P 143-
%V 80
%D June 2003
%J |beatcs|

%Z Technical Contributions
%A M. Dietzfelbinger
%A M. Kunde
%T A case against using Stirling's formula (unless you really need it)
%P 153-
%V 80
%D June 2003
%J |beatcs|

%Z Technical Contributions
%A M. Domaratzki
%T On Iterated Scattered Deletion
%P 159-
%V 80
%D June 2003
%J |beatcs|

%Z Technical Contributions
%A T. Harju
%A D. Nowotka
%T Periodicity and Unbordered Segments of Words
%P 162-
%V 80
%D June 2003
%J |beatcs|

%Z Technical Contributions
%A K. Krithivasan
%A S.V. Varma
%T On Minimising P Finite State Automata
%P 168-
%V 80
%D June 2003
%J |beatcs|

%Z Surveys and Tutorials
%T Challenges in Business Process Management: 
   Verification of business processes using Petri nets
%A W.M.P. van der Aalst
%P 174-
%V 80
%D June 2003
%J |beatcs|

%T Threshold Phenomena: The computer Scientist's Viewpoint
%A Y.C. Stamatiou
%P 199-
%Z Surveys and Tutorials
%V 80
%D June 2003
%J |beatcs|

%Z Education Matters
%T Education(al) matters: teaching P versus NP
%A H. Fernau
%P 237-
%V 80
%D June 2003
%J |beatcs|

%T Algorithm engineering
%A C. Demetrescu
%A I. Finocchi
%A G.F. Italiano
%P 48-
%Z Columns: Algorithmics
%J |BEATCS|
%V 79
%D February 2003

%A H. Ehrig
%T The Formal Specification Column 
%T On the relevance of high-level net processes
%P 64-
%Z Columns: Formal Specification
%J |BEATCS|
%V 79
%D February 2003

%T A physics-free introduction to the quantum computation model
%A S.A. Fenner
%P 69-85
%Z Columns: Computational Complexity
%J |BEATCS|
%V 79
%D February 2003
%U http://arXiv.org/abs/cs/0304008/

%T Newman's lemma -- a case study in proof automation and geometric logic
%A M. Bezem
%A Th. Coquand
%P 86-
%Z Columns: Logic in Computer Science
%J |BEATCS|
%V 79
%D February 2003

%T Distributed algorithmic mechanism design: recent results and future directions
%A J. Feigenbaum
%A S. Shenker
%P 101-
%Z Columns: Distributed Computing
%J |BEATCS|
%V 79
%D February 2003

%T Temporal logic with past is exponentially more succinct
%A N. Markey 
%P 122-
%Z Columns: Concurrency
%J |BEATCS|
%V 79
%D February 2003

%T Biomolecular computing in silico
%A M. Garzon
%P 129-
%Z Columns: Natural Computing
%J |BEATCS|
%V 79
%D February 2003

%T An overview of conjunctive grammars
%A A. Okhotin
%P 145-
%Z Columns: Formal Language Theory
%J |BEATCS|
%V 79
%D February 2003

%A L. Longpr\'e
%A V. Kreinovich
%T Can quantum computers be useful when there are not yet enough qubits?
%P 164-
%Z Technical Contributions
%J |BEATCS|
%V 79
%D February 2003

%A R. Siromoney
%A B. Das
%T DNA algorithm for breaking a propositional logic based cryptosystem
%P 170-
%Z Technical Contributions
%J |BEATCS|
%V 79
%D February 2003

%T Combinatorics on words -- a tutorial
%A J. Berstel
%A J. Karhum\"aki
%P 178-
%Z Surveys and Tutorials
%J |BEATCS|
%V 79
%D February 2003

%T The theory of finite-state adventures
%A W. Brauer
%A M. Holzer
%A B. K\"onig
%A S. Schwoon
%P 230-
%Z Education Matters
%J |BEATCS|
%V 79
%D February 2003

%T Puzzle Corner
%Z Puzzle Corner
%A L. Rosaz
%P 288-
%J |BEATCS|
%V 79
%D February 2003

%T Edsger Wybe Dijkstra (1930-2002): A Portrait of a Genius
%A K. Apt
%P 290-
%J |BEATCS|
%V 79
%D February 2003

%T Primes in P
%A J. Radhakrishnan
%P 61-
%Z News from India
%V 78
%D October 2002
%J |beatcs|

%T Primes $\in$ P (Without Assumptions)
%P 67-
%A J. D\'{\i}az
%Z Columns: Algorithmics
%V 78
%D October 2002
%J |beatcs|

%A H. Ehrig 
%T Bigraphs meet Double Pushouts
%P 72-
%Z Columns: Formal Specification
%V 78
%D October 2002
%J |beatcs|

%T Understanding the Mulmuley-Sohoni Approach to P vs. NP
%A K.W. Regan
%P 86-
%Z Columns: Computational Complexity
%V 78
%D October 2002
%J |beatcs|
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column78.ps

%T Pairwise Testing
%A A. Blass
%A Y. Gurevich
%P 100-
%Z Columns: Logic in Computer Science
%V 78
%D October 2002
%J |beatcs|

%T Distributed Communication Algorithms
%A I. Chatzigiannakis
%A S. Nikoletseas
%A P. Spirakis
%P 133-
%Z Columns: Distributed Computing
%V 78
%D October 2002
%J |beatcs|

%T Roadmap of Infinite Results
%A J. Srba
%P 163-
%Z Columns: Concurrency
%V 78
%D October 2002
%J |beatcs|

%T An Introduction to Probabilistic Automata
%A M. Stoelinga
%Z Columns: Concurrency
%P 176-
%V 78
%D October 2002
%J |beatcs|

%T Universality and Quantum Computing
%A M. Hirvensalo
%P 199-
%Z Columns: Natural Computing
%V 78
%D October 2002
%J |beatcs|

%T Membrane Computing: New Results, New Problems
%A C. Mart\'{\i}n-Vide
%A A. P\u{a}un
%A G. P\u{a}un
%P 204-
%Z Columns: Formal Language Theory
%V 78
%D October 2002
%J |beatcs|

%Z Reflections
%T EATCS Award Acceptance Speech
%A M. Nivat
%P 213-
%V 78
%D October 2002
%J |beatcs|

%A D.S. Bridges
%T Reality and Virtual Reality in Mathematics
%P 221-
%Z Technical Contributions
%V 78
%D October 2002
%J |beatcs|

%A R. Freund
%A M. Oswald
%T A Short Note on Analysing P Systems with Antiport Rules
%P 231-
%Z Technical Contributions
%V 78
%D October 2002
%J |beatcs|

%A J. Honkala
%T A Note on Systems of Alternative Word Equations
%P 237-
%Z Technical Contributions
%V 78
%D October 2002
%J |beatcs|

%A G. Rote
%T Crossing the Bridge at Night
%P 241-
%Z Technical Contributions
%V 78
%D October 2002
%J |beatcs|

%A L. Staiger
%A H. Yamasaki
%T A Simple Example of an $\omega$-Language Topologically
%P 247-
%Z Technical Contributions
%V 78
%D October 2002
%J |beatcs|

%Z Education Matters
%T A Note on MMiSS
%A B. Krieg-Br\"uckner
%P 252-
%V 78
%D October 2002
%J |beatcs|

%T Ole-Johan Dahl, Obituary
%A K. Nygaard
%P 323-
%V 78
%D October 2002
%J |beatcs|
%Z Miscellaneous  

%T Kristen Nygaard, Obituary
%A O. Lehrmann Madsen
%P 325-
%Z Miscellaneous  
%V 78
%D October 2002
%J |beatcs|

%T Structure of Scientific Collaboration in Graph Transformation 
%A G. Valiente
%P 329-
%Z Miscellaneous  
%V 78
%D October 2002
%J |beatcs|

%A J. D\'{\i}az
%T Analysis of Algorithms (AofA): Part I: 1993 -- 1998  (``Dagstuhl Period'')
%Z Columns: Algorithmics
%P 42-
%V 77
%D June 2002
%J |beatcs|

%T A New Experience with Graph Transformation 
%A A. Qemali
%P 63-
%Z Columns: Formal Specification
%V 77
%D June 2002
%J |beatcs|

%T Recent Developments in Explicit Constructions of Extractors 
%A R. Shaltiel
%P 67-
%Z Columns: Computational Complexity
%V 77
%D June 2002
%J |beatcs|
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column77.ps

%T Algorithms vs. Machines
%A A. Blass
%A Y. Gurevich
%P 96-
%Z Columns: Logic in Computer Science
%V 77
%D June 2002
%J |beatcs|

%T Distributed Computation Meets Design Theory: 
   Local Scheduling for Disconnected Cooperation 
%A by A. Russell
%A A.A. Shvartsman
%P 120-
%Z Columns: Distributed Computing
%V 77
%D June 2002
%J |beatcs|

%T Evolutionary Computation: A Guided Tour 
%A Th. B\"ack
%P 132-
%Z Columns: Natural Computing
%V 77
%D June 2002
%J |beatcs|

%T Meta-Mathematics and the Foundations of Mathematics 
%A G.J. Chaitin
%P 167-
%Z Reflections
%V 77
%D June 2002
%J |beatcs|

%A C.S. Calude
%A E. Calude
%T The Bridge Crossing Problem
%P 180-
%Z Technical Contributions
%V 77
%D June 2002
%J |beatcs|

%A V. Kreinovich
%A L. Longpr\'e
%T Why is Selecting the Simplest Hypothesis (Consistent with Data) 
  a Good Idea? A Simple Explanation
%P 191-
%Z Technical Contributions
%V 77
%D June 2002
%J |beatcs|

%A P.V. Silva
%T Recognizable subsets of a group: finite extensions and the abelian case
%P 195-
%Z Technical Contributions
%V 77
%D June 2002
%J |beatcs|

%A G.J. Woeginger
%T Open problems in the theory of scheduling
%P 67-83
%Z Columns: Algorithmics
%V 76
%D February 2002
%J |beatcs|

%T A Review of Algebraic Specification and Component Techniques at TU Berlin
%A H. Ehrig
%P 84-87
%Z Columns: Formal Specification
%V 76
%D February 2002
%J |beatcs|

%T Derandomization: a brief overview
%A V. Kabanets
%P 88-103
%Z Columns: Computational Complexity
%V 76
%D February 2002
%J |beatcs|
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column76.ps

%T Wavelength Routing in All-Optical Tree Networks: A Survey
%A I. Caragiannis
%A Ch. Kaklamanis
%A P. Persiano
%P 104-123
%Z Columns: Distributed Computing
%V 76
%D February 2002
%J |beatcs|

%T Alternative composition does not imply non-determinism
%A S. Andova
%A J.C.M. Baeten
%P 125-127
%Z Columns: Concurrency
%V 76
%D February 2002
%J |beatcs|

%T Artificial Chemistries
%A P. Speroni di Fenizio
%P 128-141
%Z Columns: Natural Computing
%V 76
%D February 2002
%J |beatcs|

%T State Complexity of Finite and Infinite Regular Languages
%A S. Yu
%P 142-152
%Z Columns: Formal Language Theory
%V 76
%D February 2002
%J |beatcs|

%A J.J. Arulanandham
%A C.S. Calude
%A M.J. Dinneen
%T Bead-Sort: A Natural Sorting Algorithm
%P 153-162
%Z Technical Contribution
%V 76
%D February 2002
%J |beatcs|
%U http://www.cs.auckland.ac.nz/CDMTCS/researchreports/171joshua.pdf

%A M. Madhu
%A K. Krithivasan
%T Improved Results about Universality of P systems
%P 162-168
%Z Technical Contribution
%V 76
%D February 2002
%J |beatcs|

%Z Columns: Algorithmics
%A J. D\'{\i}az
%T H--Colorings of Graphs
%P 82-
%V 75
%D October 2001
%J |beatcs|

%Z Columns: Formal Specification Column
%T A Review of Graph Grammars and Preview of ICGT 2002: The First International
    Conference on Graph Transformation
%A H. Ehrig
%P 93-
%V 75
%D October 2001
%J |beatcs|

%Z Columns: Computational Complexity
%T The Art of Uninformed Decisions
%A E. Fischer
%P 97-
%V 75
%D October 2001
%J |beatcs|
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column75.ps

%Z Columns: Logic in Computer Science
%T How to Find a Coin: Propositional Program Logics Made Easy
%A N.V. Shilov
%A K. Yi
%P 127-
%V 75
%D October 2001
%J |beatcs|
%U http://ropas.kaist.ac.kr/\~shilov/rereeasy.ps

%Z Columns: Distributed Computing
%T Hardness Results and Efficient Appromixations 
   for Frequency Assignment Problems and the Radio Coloring Problem
%A D.A. Fotakis
%A S.E. Nikoletseas
%A V.G. Papadopoulou
%A P.G. Spirakis
%P 152-
%V 75
%D October 2001
%J |beatcs|

%Z Columns: Concurrency
%T Does Combining Nondeterminism and Probability Make Sense?
%A P. Panangaden
%P 182-
%V 75
%D October 2001
%J |beatcs|

%Z Columns: Natural Computing
%T Aqueous Computing: Writing into Fluid Memory
%A T. Head
%A S. Gal
%P 190-
%V 75
%D October 2001
%J |beatcs|

%Z Columns: Formal Language Theory
%T Language Generating by Means of Membrane Systems 
%A C. Mart\'{\i}n-Vide
%A G. P\u{a}un
%P 199-
%V 75
%D October 2001
%J |beatcs|

%A R. Freund
%T Special Variants of P Systems Inducing an Infinite Hierarchy with
   Respect to the Number of Membranes
%P 209-
%Z Technical Contributions
%V 75
%D October 2001
%J |beatcs|

%A J. Honkala
%T A Note on Uniform HDT0L Systems
%P 220-
%Z Technical Contributions
%V 75
%D October 2001
%J |beatcs|

%Z Educational Matters
%T Algebraic Specification goes Multimedia -- 
   A Few Tentative Steps
%A R. Klempien-Hinrichs
%A H.-J. Kreowski
%P 224-
%V 75
%D October 2001
%J |beatcs|

%Z Miscellaneous
%T Recent Elsevier Science Publishing Policies
%A A. Sevenster
%P 301-
%V 75
%D October 2001
%J |beatcs|

%Z Columns: Formal Specification
%T On the Roots, Birth and Childhood of ETAPS
%A H. Ehrig
%P 58-
%V 74
%D June 2001
%J |beatcs|

%Z Columns: Computational Complexity
%T The Division Breakthroughs
%A E. Allender
%P 61-
%V 74
%D June 2001
%J |beatcs|
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column74.ps

%Z Columns: Logic in Computer Science
%T Is Randomness ``Native'' to Computer Science?
%A M. Ferbus--Zanda
%A S. Grigorieff
%P 78-
%V 74
%D June 2001
%J |beatcs|

%Z Columns: Distributed Computing
%T Stability in Routing: Networks and Protocols
%A M. Mavronicolas
%P 119-
%V 74
%D June 2001
%J |beatcs|

%Z Columns: Concurrency
%T Construction and Verification of Performance and Reliability Models
%A H. Hermanns
%P 135-
%V 74
%D June 2001
%J |beatcs|

%Z Columns: Natural Computing
%T Some Open Problems Related to Quantum Computing
%A M. Hirvensalo
%P 154-
%V 74
%D June 2001
%J |beatcs|

%Z Columns: Formal Language Theory
%T Conway's Problem and the Communication of Languages
%A J. Karhum\"aki
%A I. Petre
%P 171-
%V 74
%D June 2001
%J |beatcs|

%Z Reflections
%T Gleaning the Past and the Future in Computer Science
%A C. B\"ohm
%P 178-
%V 74
%D June 2001
%J |beatcs|

%Z Technical Contributions
%A S. Baumer
%A J.L. Esteban
%A J. Tor\'an
%T Minimally Unsatisfiable CNF Formulas
%P 190-
%V 74
%D June 2001
%J |beatcs|

%Z Technical Contributions
%A U. Brandt
%A H.K.-G. Walter
%T The Cocke-Younger-Kasami Algorithm -- Revised --
%P 193-
%V 74
%D June 2001
%J |beatcs|

%Z Technical Contributions
%A G. D\'anyi
%T A component Hierarchy of $\lambda$--, and Chain-free Cooperating
   Distributed Context Free Grammars
%P 205-
%V 74-
%D June 2001
%J |beatcs|

%Z Technical Contributions
%A A. Rodr\'{\i}guez-Pat\'on
%T On the Universality of P Systems with Membrane Creation
%P 229-
%V 74
%D June 2001
%J |beatcs|

%Z Educational Matters
%T Animation of Relations between Computational Models and Their Language Representations
%A A.F. da Fonseca
%A A.H.R. da Silva
%A M. Ayala-Rinc\'on
%A H.W. Poubel
%A J. de Siqueira
%P 235-
%V 74
%D June 2001
%J |beatcs|

%T The DFG Priority Programme 
   ``Integration of Software Specification Techniques for Applications in Engineering''
%A M. Gro{\ss}e-Rhode
%P 52-
%Z Columns: Formal Specification
%V 73
%D February 2001
%J |beatcs|

%Z Columns: Computational Complexity
%T Time-Space Lower Bounds for Satisfiability
%A D. van Melkebeek
%P 57-
%V 73
%D February 2001
%J |beatcs|
%%U http://www.neci.nj.nec.com/homepages/fortnow/beatcs/column73.ps
%%X = allemaal vervangen =
%%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column73.ps
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column73.ps

%Z Columns: Logic in Computer Science
%T Tree-Decompositions and the Model-Checking Problem
%A J. Flum
%P 78-
%V 73
%D February 2001
%J |beatcs|

%Z Columns: Distributed Computing
%T Distributed Computing Theory to Date (Part I: Models and an Example)
%A M. Mavronicolas
%P 99-
%V 73
%D February 2001
%J |beatcs|

%Z Columns: Natural Computing Column Neural Computing
%A H.T. Siegelmann
%T Neural Computing
%P 107-
%V 73
%D February 2001
%J |beatcs|

%Z Columns: Formal Language Theory Column
%T Some New Results on Post Correspondence Problem and Its Modifications
%A V. Halava
%A T. Harju
%P 131-
%V 73
%D February 2001
%J |beatcs|

%A A.Q. Gates
%A V. Kreinovich
%T Strassen's Algorithm Made (Somewhat) More Natural: A Pedagogical Remark
%P 142-
%V 73
%D February 2001
%J |beatcs|
%Z Technical Contributions

%A J. Kari
%T A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata
%P 146-
%Z Technical Contributions
%V 73
%D February 2001
%J |beatcs|

%A S.N. Krishna
%A R. Rama
%T A Note on Parallel Rewriting in P Systems 
%P 147-
%Z Technical Contributions
%V 73
%D February 2001
%J |beatcs|

%Z Educational Matters
%T Computability in an Introductory Course on Programming
%A H.J. Schneider 
%P 153-
%V 73
%D February 2001
%J |beatcs|

%Z Columns: Formal Specification
%T Graph Transformation and Visual Modeling Techniques: 
   Workshop Summary and HowTo
%A A. Corradini
%A R. Heckel
%P 69-
%V 72
%D October 2000
%J |beatcs|

%Z Columns: Formal Specification
%T The Role of Mathematics and Formal Specification Techniques in Software System Development
%A H. Ehrig
%A G. Schr\"oter
%P 77-
%V 72
%D October 2000
%J |beatcs|

%Z Columns: Computational Complexity
%T A Survey of Constant Time Parallel Sorting
%A W. Gasarch
%A E. Golub
%A C. Kruskal
%P 84-
%V 72
%D October 2000
%J |beatcs|
%%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column72.ps
%U http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column72.ps

%Z Columns: Logic in Computer Science
%T A New Zero-One Law and Strong Extension Axioms
%A A. Blass 
%A Y. Gurevich
%P 103-
%V 72
%D October 2000
%J |beatcs|

%Z Columns: Distributed Computing
%T Annotated Bibliography on Counting Networks
%A M. Mavronicolas
%P 123-
%V 72
%D October 2000
%J |beatcs|

%Z Columns: Concurrency
%T On the Algebraic Structure of Petri Nets
%A V. Sassone
%V 72
%D October 2000
%J |beatcs|
%P 133-

%Z Columns: Natural Computing
%T Neural Computation: A Research Topic for Theoretical Computer Science?
     Some Thoughts and Pointers 
%A W. Maass
%P 149-
%V 72
%D October 2000
%J |beatcs|

%Z Columns: Formal Language Theory
%T Contextual Generalized Sequential Machines 
%A C. Mart\'{\i}n-Vide
%A A. Mateescu
%P 159-
%V 72
%D October 2000
%J |beatcs|

%Z Technical Contributions
%A J. Esparza
%A P. Rossmanith
%A S. Schwoon
%T A Uniform Framework for Problems on Context-Free Grammars
%P 169-
%V 72
%D October 2000
%J |beatcs|

%Z Technical Contributions
%A J. Honkala
%T Zeros of Z-rational Sequences and Thin 0L Languages
%P 178-
%V 72
%D October 2000
%J |beatcs|

%Z Technical Contributions
%A C. Mart\'{\i}n-Vide
%A G. P\u{a}un
%T Computing with Membranes: One More Collapsing Hierarchy
%P 183-
%V 72
%D October 2000
%J |beatcs|
%U http://bioinformatics.bio.disco.unimib.it/psystems/papers.html

%Z Educational Matters
%T The Joys of Teaching Formal Language Theory to Children 
%A J.V. Rauff
%V 72
%D October 2000
%J |beatcs|
%P 189-
     
%Z Historical Comments
%T Trees and Term Rewriting in 1910: On a Paper by Axel Thue
%A M. Steinby
%A W. Thomas
%P 256-
%V 72
%D October 2000
%J |beatcs|

%Z Opinions
%T A Renaissance of Automata Theory?
%A S. Yu
%P 270-
%V 72
%D October 2000
%J |beatcs|

%A H. Ehrig
%Z Columns: Formal Specification
%T On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000
%P 90-
%J |beatcs|
%D June 2000
%V 71

%Z Columns: Formal Specification
%T Failure-Divergence Semantics as a Formal Basis for an Object-Oriented Integrated Formal Method
%A C. Fischer
%A  H. Wehrheim
%P 92-
%J |beatcs|
%D June 2000
%V 71

%A L. Fortnow
%Z Columns: Computational Complexity
%T Diagonalization
%P 102-
%J |beatcs|
%D June 2000
%V 71
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column71.ps

%Z Columns: Distributed Computing
%T A Combinatorial Characterization of Properties Preserved by Antitokens
%A C. Busch
%A N. Demetriou
%A M. Herlihy
%A M. Mavronicolas
%P 114-
%J |beatcs|
%D June 2000
%V 71

%Z Columns: Natural Computing
%T Natural Data Mining Techniques
%A J.N. Kok
%A W.A. Kosters
%P 133-
%J |beatcs|
%D June 2000
%V 71
%U http://www.liacs.nl/\~kosters/datam.ps

%A A. Salomaa
%Z Columns: Formal Language Theory
%T Depth of Functional Compositions
%P 143-
%J |beatcs|
%D June 2000
%V 71

%Z Reflections
%T The Genomics Revolution and its Challenges for Algorithmic Research  
%A R.M. Karp
%P 151-
%J |beatcs|
%D June 2000
%V 71

%Z Technical Contributions   
%A V. Kreinovich
%A L. Longpr\'e
%T How Important is Theory for Practical Problems?
   A Partial Explanation of Hartmanis' Observation
%P 160-
%J |beatcs|
%D June 2000
%V 71

%Z Technical Contributions
%A U. Sch\"oning
%T Mastering the Master Theorem
%P 165-
%J |beatcs|
%D June 2000
%V 71

%Z Technical Contributions
%A S. V\'agv\"olgyi
%T Intersection of Finitely Generated Congruences over the
   Term Algebra with Equal Trunks
%P 167-
%J |beatcs|
%D June 2000
%V 71

%Z Surveys and Tutorials
%T Graph Transformation and Visual Modeling Techniques
%A R. Heckel
%A G. Engels
%J |beatcs|
%D June 2000
%V 71
%P 186-

%Z Educational Matters
%T Two Classical Theorems Revisited
%A R. Morales-Bueno
%A L. Fortes
%A Ll. Mora
%A F. Triguero
%J |beatcs|
%D June 2000
%V 71
%P 204-

%Z Problems and Solutions
%A K.V. Archangelsky
%T The length of homogeneous subwords in rational formal power series
%P 253-
%J |beatcs|
%D June 2000
%V 71

%Z Columns: Computational Complexity
%T Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey
%A A. Srinivasan
%P 67--76
%J |beatcs|
%D February 2000
%V 70
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column70.ps.gz
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column70.ps

%Z Columns: Formal Specification
%T On Formal Semantics and Integration of Object-Oriented Modeling Languages
%A H. Ehrig
%A R. Geisler
%A M. Gro{\ss}e-Rhode
%A M. Klar
%A S. Mann 
%P 77--81
%J |beatcs|
%D February 2000
%V 70

%Z Columns: Logic in Computer Science
%T The Underlying Logic of Hoare Logic
%A A. Blass
%A Y. Gurevich
%P 82-110
%J |beatcs|
%D February 2000
%V 70
%U http://research.microsoft.com/\~gurevich/Opera/142.ps

%Z Columns: Concurrency
%T Security Analysis using Flow Logics
%A C. Bodei
%A P. Degano
%A F. Nielson
%A H.R. Nielson
%P 112--129
%J |beatcs|
%D February 2000
%V 70

%Z Columns: Natural Computing
%T Quantum Computing and Communication Complexity
%A H. Buhrman
%P 131--141
%J |beatcs|
%D February 2000
%V 70

%Z Columns: Formal Language Theory
%T The D0L Problem Revisited
%A J. Honkala
%P 142--147
%J |beatcs|
%D February 2000
%V 70

%Z Reflections
%T Automata: Glimpses from Past and Present
%A A. Salomaa
%P 148--155
%J |beatcs|
%D February 2000
%V 70

%Z Technical Contributions
%A E. M\"akinen
%T A Conjecture on the Error Bound of the Barycenter Heuristic
%P 156--158
%J |beatcs|
%D February 2000
%V 70

%Z Technical Contributions
%A R.A. Trejo
%A V. Kreinovich
%A L. Longpr\'e
%T Choosing a Physical Model: Why Symmetries?
%P 159--161
%J |beatcs|
%D February 2000
%V 70

%A M.-w. Wang
%T On the Irregularity of the Duplication Closure
%P 162--163
%Z Technical Contributions
%J |beatcs|
%D February 2000
%V 70

%Z Educational Matters
%A H.-J. Kreowski
%Z Educational Matters
%P 164--166
%J |beatcs|
%D February 2000
%V 70
%T The joy of teaching Theoretical Computer Science
%U http://www.informatik.uni-bremen.de/\~kreo/EducationalMatters/january00.ps

%T Announcement on On-Line Encyclopedia of Integer Sequences
%A N.J.A. Sloane
%P 296
%J |beatcs|
%D February 2000
%V 70
%U http://www.research.att.com/\~njas/sequences/index.html

%T Computational Tractability: The View From Mars
%A R.G. Downey
%A M.R. Fellows
%A U. Stege
%P 73-97
%Z Columns: Computational Complexity
%J |beatcs|
%D October 1999
%V 69
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column69.ps.gz
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column69.ps

%T From Basic Views and Aspects to Integration of 
   Specification Formalisms
%A H. Ehrig
%A J. Padberg
%A F. Orejas
%P 98-108
%Z Columns: Formal Specification Column
%J |beatcs|
%D October 1999
%V 69

%T Conservative Extension in Structural Operational Semantics
%A L. Aceto
%A W. Fokkink
%A C. Verhoef
%P 110-132
%Z Columns: Concurrency
%J |beatcs|
%D October 1999
%V 69

%T On the Regularity of Duplication Closure
%A J. Dassow
%A V. Mitrana
%A G. Paun
%P 133-136
%Z Technical Contributions
%J |beatcs|
%D October 1999
%V 69

%T Maximization versus Minimization in Some Optimization Problems
%A W. Klostermeyer
%P 137-140
%Z Technical Contributions
%J |beatcs|
%D October 1999
%V 69

%T Computing with Membranes: 
   A Correction, Two Problems, and Some Bibliographical Remarks
%A G. Paun
%P 141-144
%Z Technical Contributions
%J |beatcs|
%D October 1999
%V 69

%T Application of Kolmogorov Complexity to Image Compression: 
   It Is Possible to Have a Better Compression, 
   But It Is Not Possible to Have the Best One
%A S. Subbaramu
%A A.Q. Gates
%A V. Kreinovich
%P 145-150
%Z Technical Contributions
%J |beatcs|
%D October 1999
%V 69

%T An Introductory Programming Pilot Course Using Java
%A X. Franch
%A J. Gabarr\'o
%A A. G\'omez
%A A. V\'azquez
%A J. V\'azquez
%P 152-154
%Z Educational Matters
%J |beatcs|
%D October 1999
%V 69
%U http://www.informatik.uni-bremen.de/\~kreo/EducationalMatters/september99.ps

%T An Open Problem on Ground Tree Transducers and Ground Term Rewrite Systems
%A S. V\'agv\"olgyi
%P 225-227
%Z Problems and Solutions
%J |beatcs|
%D October 1999
%V 69

%T Guidelines for ICALP Organization Proposals
%J |BEATCS|
%V 68
%D june 1999
%P 18-
%Z ICALP

%T Twelve Problems in Resource-Bounded Measure
%A J.H. Lutz
%A E. Mayordomo
%J |BEATCS|
%V 68
%D june 1999
%P 64-
%Z Columns: Computational Complexity
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column68.ps.gz
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column68.ps 

%T On a Reference Model for the Formalization and Integration of Software Specification Languages
%A M. Grosse-Rhode
%J |BEATCS|
%V 68
%D june 1999
%P 81-
%Z Columns: Formal Specification

%T Why are Modal Logics so Robustly Decidable? 
%A E. Gr\"adel
%J |BEATCS|
%V 68
%D june 1999
%P 90-103
%Z Columns: Logic in Computer Science
%U ftp://ftp.informatik.rwth-aachen.de/pub/FMT/graedel/Gr-eatcs99.ps

%T The Pi-Calculus: Notes on Labelled Semantics
%A P. Quaglia
%J |BEATCS|
%V 68
%D june 1999
%P 104-
%Z Columns: Concurrency

%T Why Evolutionary Algorithms
%A D.B. Fogel
%A Z. Michalewicz
%J |BEATCS|
%V 68
%D june 1999
%P 115-
%Z Columns: Natural Computing

%T Many-Valued Truth Functions, Cern\'y's Conjecture and Road Coloring
%A A. Mateescu
%A A. Salomaa
%J |BEATCS|
%V 68
%D june 1999
%P 134-
%Z Columns: Formal Language Theory
%U http://www.tucs.abo.fi/publications/techreports/TR274.html

%T A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages
%A P. D\"om\"osi
%A S. Okawa
%A S. Hirose
%J |BEATCS|
%V 68
%D june 1999
%P 151-
%Z Technical Contributions

%T On Average Bit Complexity of Interval Arithmetic
%A C. Hamzo
%A V. Kreinovich
%J |BEATCS|
%V 68
%D june 1999
%P 153-
%Z Technical Contributions

%T On Chains of Word Equations and Test Sets
%A J. Honkala
%J |BEATCS|
%V 68
%D june 1999
%P 157-
%Z Technical Contributions

%T Injectivity of the Quotient h\g of Two Morphisms and Ambiguity of Linear Grammars
%A P. Turakainen
%J |BEATCS|
%V 68
%D june 1999
%P 160-
%Z Technical Contributions

%T Unconditional Security in Cryptography - was Shannon too Pessimistic?
%A I. Damgard
%J |BEATCS|
%V 68
%D june 1999
%P 166-179
%Z Surveys and Tutorials

%T Progress in Descriptive Complexity
%J |BEATCS|
%V 67
%D february 1999
%A N. Immerman
%P 72-80
%Z Columns: Computational Complexity
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column67.ps.gz
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column67.ps

%A F. Cornelius
%J |BEATCS|
%V 67
%D february 1999
%T An Overview of the Distributed System Classification and 
  Integration Framework DeCIF
%Z Columns: Formal Specification
%P 82-92

%Z Columns: Logic in Computer Science
%J |BEATCS|
%V 67
%D february 1999
%A Y. Gurevich
%T The Sequential ASM Thesis
%P 93-124
%U http://http://research.microsoft.com/\~gurevich/Opera/136.ps

%Z Columns: Natural Computing
%J |BEATCS|
%V 67
%D february 1999
%A M. Amos
%T Theoretical and Experimental DNA Computation
%P 125-138

%Z Columns: Formal Language Theory
%J |BEATCS|
%V 67
%D february 1999
%A G. Paun
%T Computing with Membranes: An Introduction
%P 139-152

%A M. Koshelev
%A V. Kreinovich
%A L. Longpr\'e
%T Encryption Algorithms Made
 (Somewhat) More Natural (a pedagogical remark)
%P 153-156
%J |BEATCS|
%V 67
%D february 1999
%Z Technical Contributions

%A A. Paun
%T On Time-Varying H Systems
%P 157-164
%Z Technical Contributions
%J |BEATCS|
%V 67
%D february 1999

%A I. Petre
%T A Normal form for P-Systems
%P 165-172
%Z Technical Contributions
%J |BEATCS|
%V 67
%D february 1999

%A G. Richomme
%T Another Characterization of Sturmian Words (one more)
%P 173-175
%J |BEATCS|
%V 67
%Z Technical Contributions
%D february 1999
%%U http://www.laria.u-picardie.fr/\~richomme/Publications/BEATCS67.ps.gz
%U http://www.laria.u-picardie.fr/~richomme/CV/DescriptifsPublications/Ric1999a.html

%A M. Schmidt
%T Time-Bounded Kolmogorov Complexity May Help in Search for
  Extra Terrestrial Intelligence (SETI)
%P 176-180
%Z Technical Contributions
%J |BEATCS|
%V 67
%D february 1999

%A Y. Yam
%T Reducing the Number of Rules in Intelligent Control: A New Application
 Area for Algebraic Complexity Techniques
%P 181-184
%Z Technical Contributions
%J |BEATCS|
%V 67
%D february 1999

%A H.-J. Kreowski
%T The Teaching of TCS at the University of Bremen
%P 185-189
%Z Educational Matters
%J |BEATCS|
%V 67
%D february 1999
%U http://www.informatik.uni-bremen.de/\~kreo/EducationalMatters/january99.ps

%A J.E. Savage
%T A New Approach to the First Theory Course
%P 190-194
%Z Educational Matters
%J |BEATCS|
%V 67
%D february 1999

%Z Problems and Solutions
%T Decomposable regular languages and the shuffle operator 
%A Ph. Schnoebelen
%P 283-289
%J |BEATCS|
%V 67
%D february 1999

%T Jiri Becvar -- Obituary
%A Jiri Wiedermann
%P 291
%J |BEATCS|
%V 67
%D february 1999

%%-----------------------------
%A E. Allender
%Z Columns: Computational Complexity
%T News from the Isomorphism Front
%P 73-82
%J |BEATCS|
%D October 1998
%V 66
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column66.ps.gz
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column66.ps

%Z Columns: Formal Specification
%T Classification of Petri Nets Using Adjoint Functors
%A J. Padberg
%P 85-91
%J |BEATCS|
%D October 1998
%V 66

%Z Columns: Concurrency
%T Towards Global Computations Guided by Concurrency Theory
%A B. Thomsen
%A L. Leth Thomsen
%P 92-98
%J |BEATCS|
%D October 1998
%V 66

%Z Columns: Natural Computing
%T An Introduction to Quantum Computing
%A M. Hirvensalo
%P 100-121
%J |BEATCS|
%D October 1998
%V 66

%Z Columns: Formal Language Theory
%T Networks of Language Processors: Parallel Communicating Systems
%A E. Csuhaj-Varju
%A A. Salomaa
%P 122-138
%J |BEATCS|
%D October 1998
%V 66

%A C.S. Calude
%A E. Calude
%A C. Stefanescu
%T Computational Complementarity for Mealy Automata
%P 139-150
%Z Technical Contributions
%J |BEATCS|
%D October 1998
%V 66

%A A.Q. Gates
%A V. Kreinovich
%A L. Longpr\'e
%T Kolmogorov Complexity Justifies Software Engineering Heuristics
%P 150-154
%Z Technical Contributions
%J |BEATCS|
%D October 1998
%V 66

%A E. Kindler
%A M. Weber
%T The Dimensions of Petri Nets: The Petri Net Cube
%P 155-166
%Z Technical Contributions
%J |BEATCS|
%D October 1998
%V 66

%A M. Koshelev
%T Towards the Use of Aesthetics in Decision Making: 
  Kolmogorov Complexity Formalizes Birkhoff's Idea
%P 166-170
%Z Technical Contributions
%J |BEATCS|
%D October 1998
%V 66

%A E. Ohlebusch
%T Modularity of Termination for Disjoint Term Graph Rewrite Systems: 
   A Simple Proof
%P 171-177
%J |BEATCS|
%D October 1998
%V 66
%Z Technical Contributions
	
%T The Hausdorff Measure of Regular \omega-languages is Computable
%A L. Staiger
%P 178-182
%Z Technical Contributions
%J |BEATCS|
%D October 1998
%V 66
%U http://www.mathematik.uni-halle.de/reports/shadows/98-30report.html

%% -------------------------------------------------------------
%A E. Mann
%T Some Recommendations for a New Orientation of the Community's 
%T R&D Framework Programme
%J |BEATCS|
%V 65
%D june 1998
%P 44-
%Z European Community R&D Framework Programme

%A M.J. Dinneen
%T Group-Theoretic Methods for Designing Networks
%J |BEATCS|
%V 65
%D june 1998
%P 53-
%Z News from New Zealand

%A P. Beame
%A T. Pitassi
%T Propositional Proof Complexity: Past, Present and Future
%J |BEATCS|
%V 65
%D june 1998
%P 66-
%Z Columns: Computational Complexity
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column65.ps.gz
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column65.ps

%A H. Ehrig
%A F. Orejas
%T Integration Paradigm for Data Type and Process Specification Techniques
%J |BEATCS|
%V 65
%D june 1998
%P 90-
%Z Columns: Formal Specification

%A L. Colson
%T Functions versus Algorithms
%J |BEATCS|
%V 65
%D june 1998
%P 98-
%Z Columns: Logic in Computer Science

%A A. Mateescu
%T Words on Trajectories
%J |BEATCS|
%V 65
%D june 1998
%P 118-
%Z Columns: Formal Language Theory

%A C. Damm
%T A Note on Spectral Lower Bound Arguments for Decision Trees
%J |BEATCS|
%V 65
%D june 1998
%P 136-
%Z Technical Contributions

%A A. Geser
%T On Essential Premises for the Transformation Order
%J |BEATCS|
%V 65
%D june 1998
%P 139-
%Z Technical Contributions

%A E. M\"akinen
%T A Bibliography on Szilard Languages
%J |BEATCS|
%V 65
%D june 1998
%P 143-
%Z Bibliographies

%A F. Nake
%T Loving Teaching
%J |BEATCS|
%V 65
%D june 1998
%P 150-
%Z Educational Matters
%U http://www.informatik.uni-bremen.de/\~kreo/EducationalMatters/may98-revised.ps

%A Andrea E.F. Clementi
%A Jos\'e D.P. Rolim
%A Luca Trevisan
%T Recent Advances Towards Proving P = BPP
%J |BEATCS|
%V 64
%D february 1998
%P 96-103
%Z Columns: Computational Complexity
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column64.ps.Z
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column64.ps

%A Egon B\"orger
%A James K. Huggins
%T Abstract State Machines 1988-1998: Commented ASM Bibliography
%J |BEATCS|
%V 64
%D february 1998
%P 105-127
%Z Columns: Formal Specification
%U http://www.eecs.umich.edu/gasm/intromat.html#bib1998

%A Alasdair Urquhart
%T The Complexity of Propositional Proofs
%J |BEATCS|
%V 64
%D february 1998
%P 128-138
%Z Columns: Logic in Computer Science

%A Uwe Nestmann
%A Bj\"orn Victor
%T Calculi for Mobile Processes - Bibliography and Web Pages
%J |BEATCS|
%V 64
%D february 1998
%P 139-144
%Z Columns: Concurrency

%A Juha Honkala
%T On Slender Languages
%J |BEATCS|
%V 64
%D february 1998
%Z Columns: Formal Language Theory
%P 145-152

%A Amir M. Ben-Amram
%T Introducing: Reasonable Complete Programming Languages
%J |BEATCS|
%V 64
%D february 1998
%P 153-155
%Z Technical Contributions

%A Vladik Kreinovich
%A Luc Longpr\'e
%T Human Visual Perception and Kolmogorov Complexity: Revisited
%J |BEATCS|
%V 64
%D february 1998
%P 155-158
%Z Technical Contributions

%A Carlos Mart\'in-Vide
%A Alexandru Mateescu
%A Gheorghe P\v{a}un
%T Hybrid Grammars: The Chomsky-Marcus Case
%J |BEATCS|
%V 64
%D february 1998
%P 159-165
%Z Technical Contributions

%A Ioan Tomescu
%T A Threshold Property Concerning Words Containing All Short Factors
%J |BEATCS|
%V 64
%D february 1998
%P 166-170
%Z Technical Contributions

%A Christoph Meinel
%A Thorsten Theobald
%T Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits
%J |BEATCS|
%V 64
%D february 1998
%P 171-187
%Z Surveys and Tutorials

%A Nadia Pisanti
%T DNA Computing: A Survey
%J |BEATCS|
%V 64
%D february 1998
%P 171-187
%Z Surveys and Tutorials

%A George Rahonis
%T On Teaching Elements of Theoretical Computer Science in Greek Secondary Education
%J |BEATCS|
%V 64
%D february 1998
%P 188-216
%Z Educational Matters

%A Juha Honkala
%T On a Problem of G. Paun
%J |BEATCS|
%V 64
%D february 1998
%P 341
%Z Problems and Solutions

%A Friedrich Otto
%T Disjointness of Congruences generated by Finite Monadic String-Rewriting Systems that are Confluent is Undecidable in General
%J |BEATCS|
%V 64
%D february 1998
%P 342-348
%Z Problems and Solutions

%A Edith Hemaspaandra
%A Lane A. Hemaspaandra
%A Harald Hempel
%T An Introduction to Query Order
%J |BEATCS|
%V 63
%D october 1997
%P 93-107
%Z Columns: Computational Complexity
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column63.ps.Z
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column63.ps

%A Andrea Corradini
%A Hans-J\"org Kreowski
%T GETGRATS and APPLIGRAPH: Theory and Applications of Graph Transformation
%J |BEATCS|
%V 63
%D october 1997
%P 109-114
%Z Columns: Formal Specification

%T From Invariants to Canonization
%A Yuri Gurevich
%J |BEATCS|
%V 63
%D october 1997
%P 115-119
%Z Columns: Logic in Computer Science
%U http://research.microsoft.com/\~gurevich/Opera/131.ps

%A Erzs\'ebet Csuhaj-Varj\'u
%T Networks of Language Processors
%J |BEATCS|
%V 63
%D october 1997
%P 120-134
%Z Columns: Formal Language Theory

%A Konstantin V. Archangelsky
%T A new representation for the regular languages
%J |BEATCS|
%V 63
%D october 1997
%P 135-138
%Z Technical Contributions

%A Jean Berstel
%A Luc Boasson
%T The set of Lyndon words is not context-free
%J |BEATCS|
%V 63
%D october 1997
%P 139-140
%Z Technical Contributions

%A Douglas Bridges
%A Luminita Dediu
%T Paradise lost, or paradise regained?
%J |BEATCS|
%V 63
%D october 1997
%P 141-155
%Z Technical Contributions

%A Leonid P. Lisovnik
%T Nondeterministic systems and finite substitutions on regular languages
%J |BEATCS|
%V 63
%D october 1997
%P 156-160
%Z Technical Contributions

%A Thomas B{\"a}ck
%A Jeannette M. de Graaf
%A Joost N. Kok
%A Walter A. Kosters
%T Theory of Genetic Algorithms
%J |BEATCS|
%V 63
%D october 1997
%Z Surveys and Tutorials
%P 161-192
%U http://www.liacs.nl/\~kosters/ganew.ps.gz

%A Tom Verhoeff
%T Some Thoughts on the Role of Competitions in Computing Science Education with a Twist in the Direction of Theoretical Computer Science
%J |BEATCS|
%V 63
%D october 1997
%P 194-196
%Z Educational Matters

%A Holger Petersen
%T An Answer to a Question of Bodlaender and de Fluiter
%J |BEATCS|
%V 63
%D october 1997
%P 260
%Z Problems and Solutions

%A S\'andor V\'agv\"olgyi
%T Erasing Writing Post Correspondence Problem
%J |BEATCS|
%V 63
%D october 1997
%P 261-262
%Z Problems and Solutions

%A D.-Z. Du
%A K.-I Ko
%A A. Selman
%T In Memoriam: Ronald V. Book
%J |BEATCS|
%V 63
%D october 1997
%P 292

%A Ute Brauer
%A Wilfried Brauer
%T Silver Jubilee of EATCS
%J |BEATCS|
%V 62
%D june 1997
%P 3-23
%Z EATCS Matters

%A J. Lutz
%T Report on the Workshop on Languages, Algorithms and Complexity, Minneapolis, U.S.A.
%J |BEATCS|
%V 62
%D june 1997
%P 103
%Z Columns: Computational Complexity
%%U ftp://ftp.cs.rutgers.edu/pub/allender/column62.ps.Z
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column62.ps

%A H. Ehrig
%A A. Merten
%A J. Padberg
%T How to Transfer Concepts of Abstract Data Types to Petri Nets?
%J |BEATCS|
%V 62
%D june 1997
%P 106-114
%Z Columns: Formal Specification

%A Jouko V\"a\"an\"anen
%T Generalized Quantifiers
%J |BEATCS|
%V 62
%D june 1997
%P 115-136
%Z Columns: Logic in Computer Science

%A Olaf Burkart
%A Javier Esparza
%T More Infinite Results
%J |BEATCS|
%V 62
%D june 1997
%P 138-159
%Z Columns: Concurrency

%A Valeria Mihalache
%A Arto Salomaa
%T Lindenmayer and DNA: Watson-Crick D0L Systems
%J |BEATCS|
%V 62
%D june 1997
%P 160-175
%Z Columns: Formal Language Theory

%A Lucian Ilie
%T Some Recent Results on Contextual Languages
%J |BEATCS|
%V 62
%D june 1997
%P 176-194
%Z Columns: Formal Language Theory

%A Asat Arslanov
%T On a Conjecture of M. Van Lambalgen
%J |BEATCS|
%V 62
%D june 1997
%P 195-198
%Z Technical Contributions

%A Cristian S. Calude
%A Peter H. Hertling
%A Bakhadyr Khoussainov
%T Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?
%J |BEATCS|
%V 62
%D june 1997
%P 199-207
%Z Technical Contributions

%A Venkatesan T. Chakaravarthy
%A Kamala Krithivasan
%T A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One
%J |BEATCS|
%V 62
%D june 1997
%P 208-213
%Z Technical Contributions

%A Victor Mitrana
%T Some Remarks on Morphisms and Primitivity
%J |BEATCS|
%V 62
%D june 1997
%P 213-216
%Z Technical Contributions

%A Sylvain Porrot
%A Max Dauchet
%A Denis Pomorski
%T The Fractal Dimension of a Computable Figure is the Average Normalized Complexity of its Points
%J |BEATCS|
%V 62
%D june 1997
%P 216-221
%Z Technical Contributions

%A Bart Jacobs
%A Jan Rutten
%T A Tutorial on (Co)Algebras and (Co)Induction
%J |BEATCS|
%V 62
%D june 1997
%P 222-259
%Z Surveys and Tutorials
%U http://www.cs.kun.nl/\~bart/PAPERS/JR.ps.Z

%A Hans-J\"org Kreowski
%T Call for Contributions: On the (im-)possibilities of teaching theoretical computer science
%J |BEATCS|
%V 62
%D june 1997
%P 260-261
%Z Educational Matters

%A Hans L. Bodlaender
%A Babette de Fluiter
%T A Problem on Strings with an Application to Intervalizing Colored Graphs
%J |BEATCS|
%V 62
%D june 1997
%P 323-324
%Z Problems and Solutions

%A W. Bartol
%A E. Orlowska
%A A. Skowron
%T Helena Rasiowa, 1917-1994
%J |BEATCS|
%V 62
%D june 1997
%P 353-366

%A Hartmut Ehrig
%A Wolfgang Reisig
%T An Algebraic View on Petri Nets
%J |BEATCS|
%V 61
%D february 1997
%P 52-58
%Z Columns: Formal Specification

%A Arto Salomaa
%T Conjugate Words, Cuts of the Deck and Cryptographic Protocols   
%J |BEATCS|
%V 61
%D february 1997
%P 59-71
%Z Columns: Formal Language Theory

%A Guozhu Dong
%A Limsoon Wong 
%T Some Relationships between the FOIES and Sigma-1-1 Arity Hierarchies
%J |BEATCS|
%V 61
%D february 1997
%P 72-79
%Z Technical Contributions

%A Valeria Mihalache
%T Accepting Cooperating Distributed Grammar Systems with Terminal Derivation
%J |BEATCS|
%V 61
%D february 1997
%P 80-84
%Z Technical Contributions

%A Gheorghe P\v{a}un
%A Gabriel Thierrin
%T Morphisms and Primitivity
%J |BEATCS|
%V 61
%D february 1997
%P 85-88
%Z Technical Contributions

%A Dietmar W\"atjen
%T k-limited ED0L Languages Are Context-Sensitive
%J |BEATCS|
%V 61
%D february 1997
%P 89-91
%Z Technical Contributions

%A Ulrike Erb
%A Hans-J\"org Kreowski
%A Veronika Oechtering
%A Ingrid R\"ugge
%T Informatica Feminale: Summer University for Women in Computer Science 
%J |BEATCS|
%V 61
%D february 1997
%P 93-99
%Z Educational Matters

%A H. Ehrig
%A U. Wolter
%T The Impact and Future Role of Algebraic Specification
%J |BEATCS|
%V 60
%D october 1996
%P 74-95
%Z Columns: Formal Specification

%A A. Degtyarev
%A Y. Gurevich
%A A. Voronkov
%T Herbrand's Theorem and Equational Reasoning: Problems and Solutions
%J |BEATCS|
%V 60
%D october 1996
%P 97-
%Z Columns: Logic in Computer Science
%U http://research.microsoft.com/\~gurevich/Opera/125.ps

%A R. Cleaveland
%A S.A. Smolka
%T Strategic Directions in Computing Research - Concurrency Working Group Report
%J |BEATCS|
%V 60
%D october 1996
%P 97-122
%Z Columns: Concurrency

%A M. Lipponen
%A A. Salomaa
%T Simple Words in Equality Sets
%J |BEATCS|
%V 60
%D october 1996
%P 123-143
%Z Columns: Formal Language Theory

%A Joost Engelfriet
%T Reverse Twin Shuffles
%J |BEATCS|
%V 60
%D october 1996
%P 144
%U http://www.wi.leidenuniv.nl/\~engelfri/twinnew.ps
%Z Technical Contributions

%A Gheorghe Paun
%T Computing by Splicing: How Simple Rules?
%J |BEATCS|
%V 60
%D october 1996
%P 145-150
%Z Technical Contributions

%A Douglas Schirmer
%A Vladik Kreinovich
%T Towards a More Realistic Definition of Feasibility
%J |BEATCS|
%V 60
%D october 1996
%P 151-153
%Z Technical Contributions

%A Anthony Karel Seda
%T Quasi-Metrics and Fixed Points in Computing
%J |BEATCS|
%V 60
%D october 1996
%P 154-163
%Z Technical Contributions

%A Judith Gal-Ezer
%A Catriel Beeri
%A David Harel
%A Amiram Yehudai
%T A High-School Program in Computer Science
%J |BEATCS|
%V 60
%D october 1996
%P 165-185
%Z Educational Matters

%A Dominique Perrin
%T Obituary on M.-P. Sch\"utzenberger
%J |BEATCS|
%V 60
%D october 1996
%P 314-316

%A Horst Reichel
%T Unifying ADT - and Evolving Algebra Specifications
%J |BEATCS|
%V 59
%D june 1996
%P 112-126
%Z Columns: Algebraic Specification

%A Peter D. Mosses
%T CoFI: The Common Framework Initiative for Algebraic Specification
%J |BEATCS|
%V 59
%D june 1996
%P 127-132
%Z Columns: Algebraic Specification

%A David Benson
%T Courses on Concurrency
%J |BEATCS|
%V 59
%D june 1996
%P 133-136
%Z Columns: Concurrency

%A Arto Salomaa
%T Conjugate Words, Cuts of the Deck and Cryptographic Protocols
%J |BEATCS|
%V 59
%D june 1996
%P 137-149
%Z Columns: Formal Language Theory

%A Stephen L. Bloom
%A Zolt\'an \'Esik
%T Two Axiomatizations of a Star Semiring Quasi-Variety
%J |BEATCS|
%V 59
%D june 1996
%P 150-152
%Z Technical Contributions

%A Colm \'O D\'unlaing
%T Resolution Proofs viewed as Automata
%J |BEATCS|
%V 59
%D june 1996
%P 153-156
%Z Technical Contributions

%A Juha Honkala
%T On the Equivalence Problem of Algebraic Series with Commuting Variables
%J |BEATCS|
%V 59
%D june 1996
%P 157-162
%Z Technical Contributions

%A Luc Longpr\'e
%A Vladik Kreinovich
%T Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem
%J |BEATCS|
%V 59
%D june 1996
%P 163-164
%Z Technical Contributions

%A Mila Majster-Cederbaum
%A Markus Roggenbach
%T On two different Characterizations of Bisimulation
%J |BEATCS|
%V 59
%D june 1996
%P 164-172
%Z Technical Contributions

%A Robert Steacy
%T Structure in the Kolakoski Sequence
%J |BEATCS|
%V 59
%D june 1996
%P 173-182
%Z Technical Contributions

%A H. Ehrig
%A G. Taentzer
%T Computing by Graph Transformation, A Survey and Annotated Bibliography
%J |BEATCS|
%V 59
%D june 1996
%P 182-226
%Z Bibliographies

%A Marcelo Fiore
%A Achim Jung
%A Eugenio Moggi
%A Peter O'Hearn
%A Jon Riecke
%A Giuseppe Rosolini
%A Ian Stark
%T Domains and Denotational Semantics: History, Accomplishments and Open Problems
%J |BEATCS|
%V 59
%D june 1996
%P 227-256
%Z Surveys and Tutorials
%U http://www.cs.bell-labs.com/\~riecke/abstracts/ten-years.html

%A Lila Kari
%T DNA Computers, Tomorrow's Reality
%J |BEATCS|
%V 59
%D june 1996
%P 256 -266
%Z Surveys and Tutorials

%A Einar Smith
%T A Survey on High-Level Petri-Net Theory
%J |BEATCS|
%V 59
%D june 1996
%P 267-293
%Z Surveys and Tutorials

%A H.-J. Kreowski
%T Educational Matters
%J |BEATCS|
%V 59
%D june 1996
%P 294-296
%Z Educational Matters

%A D. Kozen
%T Erratum: On Regularity-Preserving Functions
%J |BEATCS|
%V 59
%D june 1996
%P 455

%A H. Ehrig
%A B. Mahr
%T Algebraic Techniques in Software Development
%J |BEATCS|
%V 58
%D february 1996
%P 105-117
%Z Columns: Algebraic Specification
 
%A M. Fitting
%T A Program to Compute G\"odel-L\"ob Fixpoints  
%J |BEATCS|
%V 58
%D february 1996
%P 118-130
%Z Columns: Logic in Computer Science
 
%A D. Kozen
%T On Regularity-Preserving Functions
%J |BEATCS|
%V 58
%D february 1996
%P 131-138
%Z Columns: Structural Complexity
%%U http://www.cs.cornell.edu/kozen/papers/up.ps
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column58.ps
 
%A P. Panangaden
%T Does Concurrency Theory Have Anything To Say About Parallel Programming?
%J |BEATCS|
%V 58
%D february 1996
%P 140-147
%Z Columns: Concurrency
 
%A A. Mateescu
%A A. Salomaa
%T Views on Linguistics
%J |BEATCS|
%V 58
%D february 1996
%P 148-154
%Z Columns: Formal Language Theory
 
%A C. C\^ampeanu
%T Random Numbers Are Borel Normal
%J |BEATCS|
%V 58
%D february 1996
%P 155-158
%Z Technical Contributions
 
%A H. Fernau
%T Closure Properties of Ordered Languages
%J |BEATCS|
%V 58
%D february 1996
%P 159-162
%Z Technical Contributions
%U http://www-fs.informatik.uni-tuebingen.de/\~fernau/pub-fernau/papers/ps/ordered.ps.gz
 
%A V. Mitrana
%T Distributed Catenation Versus Shuffle
%J |BEATCS|
%V 58
%D february 1996
%P 163-167
%Z Technical Contributions
 
%A A. Pagnoni
%T Detecting and Correcting Operation Errors of Distributed Systems
%J |BEATCS|
%V 58
%D february 1996
%P 168-186
%Z Technical Contributions
 
%A P.R.J. Asveld
%T A Bibliography on Fuzzy Automata, Grammars and Languages
%J |BEATCS|
%V 58
%D february 1996
%P 187-196
%Z Bibliographies
 
%A R. Melchisedech
%A M. Deininger
%A A. Drappa
%A H. Hoff
%A S. Krauss
%A J. Li
%A J. Ludewig
%A P. Mandl-Striegnitz
%T SESAM - A Software Engineering Education Tool Based on Graph Grammars
%J |BEATCS|
%V 58
%D february 1996
%P 198-221
%Z Educational Matters
 
%A G. Paun
%T Open problems
%J |BEATCS|
%V 58
%D february 1996
%P 351-352
%Z Problems and Solutions
 
%A S. Abiteboul
%T In Memoriam: Paris C. Kanellakis
%J |BEATCS|
%V 58
%D february 1996
%P 364
 
%A Hartmut Ehrig
%A Bernd Mahr
%T Theory and Practice of Software Development: A Review of Driving Forces and Expectations
%J |BEATCS|
%V 57
%D october 1995
%P 135-144
%Z Columns: Algebraic Specification
 
%A Yuri Gurevich
%T Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand
%J |BEATCS|
%V 57
%D october 1995
%P 145-166
%Z Columns: Logic in Computer Science
%%U ?? http://research.microsoft.com/\~gurevich/
 
%A Klaus Weihrauch
%T A Foundation of Computable Analysis
%J |BEATCS|
%V 57
%D october 1995
%P 167-182
%Z Columns: Structural Complexity
 
%A Gheorghe P\v{a}un
%T Splicing
%J |BEATCS|
%V 57
%D october 1995
%P 183-194
%Z Columns: Formal Language Theory
 
%A Michael Bertol
%A Klaus Reinhardt
%T The Tautologies over a Finite Set are Context-Free
%J |BEATCS|
%V 57
%D october 1995
%P 196-197
%Z Technical Contributions
 
%A G.J. Chaitin
%A A. Arslanov
%A C. Calude
%T Program-size Complexity Computes the Halting Problem
%J |BEATCS|
%V 57
%D october 1995
%P 198-200
%Z Technical Contributions
%U http://www.cs.auckland.ac.nz/\~cristian/gregHHP.ps.gz
 
%A G. Degli Antoni
%A D. Cabianca
%A M. Vaccari
%A M. Benini
%A F. Casablanca
%T Linearity of Client/Server Systems
%J |BEATCS|
%V 57
%D october 1995
%P 201-214
%Z Technical Contributions
 
%A Cyrus F. Nourani
%T Artificial Algebras
%J |BEATCS|
%V 57
%D october 1995
%P 215-218
%Z Technical Contributions
 
%A Danny Raz
%T Context-free Languages are not Closed under interior and frontier
%J |BEATCS|
%V 57
%D october 1995
%P 219-221
%Z Technical Contributions
 
%A Vincent Vajnovszki
%T Constant Time Generation of Binary Unordered Trees
%J |BEATCS|
%V 57
%D october 1995
%P 221-229
%Z Technical Contributions
 
%A Fr\'ed\'eric Geurts
%T Hierarchy of Discrete-Time Dynamical Systems, a Survey
%J |BEATCS|
%V 57
%D october 1995
%P 230-251
%Z Surveys and Tutorials

%A Gregory Kucherov
%A Pierre Lescanne
%A Peter Mosses
%T V. Antimirov - Obituary
%J |BEATCS|
%V 57
%D october 1995
%P 369
%U http://www.cs.utwente.nl/data/amast/links/v02/i07/AL0207O1.txt

%A H. Ehrig
%A H.-J. Kreowski
%A F. Orejas
%T Correctness of actualization for parameterized implementation concepts based on constructors and abstractors
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Columns: Algebraic Specification

%A P. Jancar
%T All action-based behavioural equivalences are undecidable for labelled Petri nets
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Columns: Concurrency Column

%A A. Salomaa
%T From Parikh vectors to GO territories
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Columns: Formal Language Theory

%A H. Fernau
%T A predicate for separating language classes
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Technical Contributions
%U http://www-fs.informatik.uni-tuebingen.de/\~fernau/pub-fernau/papers/ps/eatcs.bulletin95.ps.gz

%A C.N. Galley
%T An Omega(log n) time linear cost lower bound forthe single function coarsest partition problem
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Technical Contributions

%A A. Meduna
%T A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Technical Contributions

%A M. Moshkov
%T Relationships between depth of deterministic and nondeterministic acyclic programs computing functions of k-valued logic
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Technical Contributions

%A H. Prodinger
%T Digital search trees and basic hypergeometric functions
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Technical Contributions

%A K. Svozil
%T Quantum Computation and Complexity Theory II
%J |BEATCS|
%V 56
%D june 1995
%P 
%Z Surveys and Tutorials

%A M. Gro{\ss}e-Rhode
%T Transition Specifications for Dynamic Abstract Data Types
%J |BEATCS|
%V 55
%D february 1995
%P 121-128
%Z Columns: Algebraic Specification

%A Y. Gurevich
%T The Value, if any, of Decidability
%J |BEATCS|
%V 55
%D february 1995
%P 129-135
%Z Columns: Logic in Computer Science
%U http://research.microsoft.com/\~gurevich/Opera/114.ps
%X A decidable problem can be as hard as an undecidable one for all
  practical purposes.  So what is the value of a mere decidablity
  result?  That is the topic discussed in the paper.

%A J. Hartmanis
%T On the Weight of Computations
%J |BEATCS|
%V 55
%D february 1995
%P 136-138
%Z Columns: Structural Complexity

%A J. Parrow
%T Concurrency without Homotopy
%J |BEATCS|
%V 55
%D february 1995
%P 140-143
%Z Columns: Concurrency

%A A. Salomaa
%T Return to Patterns
%J |BEATCS|
%V 55
%D february 1995
%P 144-157
%Z Columns: Formal Language Theory

%A F. Buffoli
%A G. Degli Antoni
%A A. Marchese
%T OR-Parallellism in Theorem Proving: Speedups versus Timeout
%J |BEATCS|
%V 55
%D february 1995
%P 158-165
%Z Technical Contributions

%A J. Lehikoinen
%A E. M\"akinen
%T A New Distance-based Coding Method For Binary Trees
%J |BEATCS|
%V 55
%D february 1995
%P 166-169
%Z Technical Contributions

%A K. Svozil
%T Quantum Computation and Complexity Theory I
%J |BEATCS|
%V 55
%D february 1995
%P 170-207
%Z Surveys and Tutorials

%A H.-J. Kreowski
%T Conception of a Course on Syntactic Methods in Picture Generation
%J |BEATCS|
%V 55
%D february 1995
%P 208-213
%Z Educational Matters

%A H. Ehrig
%A J. Padberg
%T Linking Algebraic High Level Nets and Dynamic Abstract Data
%J |BEATCS|
%V 54
%D October 1994
%P 132-144
%Z Columns: Algebraic Specification

%A J.-E. Pin
%T Logic on Words
%J |BEATCS|
%V 54
%D October 1994
%P 145-165 
%Z Columns: Logic in Computer Science
%U http://www.liafa.jussieu.fr/\~jep/PostScript/LogicOnWords.ps.gz

%A R. Chang
%T A Machine Model for NP-approximation Problems and the Revenge of the Boolean Hierarchy
%J |BEATCS|
%V 54
%D October 1994
%P 166-182
%Z Columns: Structural Complexity
%U http://www.csee.umbc.edu/\~chang/papers/revenge/
%%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column54.ps

%A J. Gunawardena
%T Homotopy and Concurrency
%J |BEATCS|
%V 54
%D October 1994
%P 184-193
%Z Columns: Concurrency

%A A. Salomaa
%T Patterns
%J |BEATCS|
%V 54
%D October 1994
%P 194-206
%Z Columns: Formal Language Theory

%A A. Bouali
%A S. Gnesi
%A S. Larosa
%T JACK: Just Another Concurrency Kit
%J |BEATCS|
%V 54
%D October 1994
%P 207-224
%Z Technical Contributions

%A S. Marcus
%A G. P\v{a}un
%T Infinite (Almost Periodic) Words, Formal Languages and Dynamical Systems
%J |BEATCS|
%V 54
%D October 1994
%P 224-231
%Z Technical Contributions

%A H. Prodinger
%T Knuth's Old Sum - A Survey
%J |BEATCS|
%V 54
%D October 1994
%P 232-245
%Z Surveys and Tutorials

%A R. Freund
%A G. P\v{a}un
%T The shape of a language: some open problems
%J |BEATCS|
%V 54
%D October 1994
%P 378-380
%Z Problems and Solutions

%A J.F. Groote
%T An optimisation problem for an AC operator
%J |BEATCS|
%V 54
%D October 1994
%P 380-382
%Z Problems and Solutions

%A H. Ehrig
%A F. Orejas 
%T Dynamic Abstract Data Types: An Informal Proposal
%J |BEATCS|
%V 53
%D june 1994
%P 162-169
%Z Columns: Algebraic Specification

%A J. Hartmanis 
%T About the Nature of Computer Science
%J |BEATCS|
%V 53
%D june 1994
%P 170-190
%Z Columns: Structural Complexity

%A R.J. van Glabbeek 
%T What is branching time semantics and why to use it?
%J |BEATCS|
%V 53
%D june 1994
%P 191-198
%Z Columns: Concurrency

%A E. Csuhaj-Varj\'u
%A A. Meduna 
%T Grammars with context conditions
%J |BEATCS|
%V 53
%D june 1994
%P 199-212
%Z Columns: Formal Language Theory

%A P.R.J. Asveld
%T An Alternative Formulation of Cocke-Younger-Kasami's Algorithm
%J |BEATCS|
%V 53
%D june 1994
%P 213-216
%Z Technical Contributions

%A M. Lipponen
%T Primitive Words and Languages Associated to PCP
%J |BEATCS|
%V 53
%D june 1994
%P 217-226
%Z Technical Contributions

%A C.F. Nourani
%T Types, Induction, and Incompleteness
%J |BEATCS|
%V 53
%D june 1994
%P 226-247
%Z Technical Contributions

%A H. Prodinger
%T Some Polynomials Related to the Fibonacci Polynomials
%J |BEATCS|
%V 53
%D june 1994
%P 248-250
%Z Technical Contributions

%A R. Grigore
%T The Institution of Order-Sorted Equational Logic
%J |BEATCS|
%V 53
%D june 1994
%P 250-255
%Z Technical Contributions

%A A.K. Seda
%T Topological View of the Kowalski - van Emden Theorem
%J |BEATCS|
%V 53
%D june 1994
%P 256-263
%Z Technical Contributions

%A J. Steinbach
%T A Formalism for Representing Orderings
%J |BEATCS|
%V 53
%D june 1994
%P 254-263
%Z Technical Contributions

%A E. Kindler
%T Safety and Liveness Properties: A Survey
%J |BEATCS|
%V 53
%D june 1994
%P 268-272
%Z Surveys and Tutorials

%A A. Schwill
%T Fundamental Ideas of Computer Science
%J |BEATCS|
%V 53
%D june 1994
%P 274-295
%Z Educational Matters

%A O. Maler
%A L. Staiger
%T On Syntactic Congruences for Omega-Languages and the Minimization of Omega-Automata
%J |BEATCS|
%V 53
%D june 1994
%P 447-448
%Z Problems and Solutions

%A H. Ehrig
%T FLEX: A Flexible Extension and Integration Concept for Software Developments in KORSO and COMPASS
%J |BEATCS|
%V 52
%D february 1994
%P 189-202
%Z Columns: Algebraic Specification

%A Th. Coquand
%A B. Nordstr\"om
%A J.M. Smith
%A B. von Sydow
%T Type Theory and Programming
%J |BEATCS|
%V 52
%D february 1994
%P 203-228
%Z Columns: Logic in Computer Science

%A L. Fortnow
%T The Role of Relativization in Complexity Theory
%J |BEATCS|
%V 52
%D february 1994
%P 229-244
%Z Columns: Structural Complexity
%%U http://www.cs.uchicago.edu/\~fortnow/papers/relative.ps.gz
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column52.ps

%A J. Esparza
%A M. Nielsen
%T Decidability Issues for Petri Nets - a Survey
%J |BEATCS|
%V 52
%D february 1994
%P 245-262
%Z Columns: Concurrency

%A G. P\v{a}un
%T Marcus Contextual Grammars: After twenty five years
%J |BEATCS|
%V 52
%D february 1994
%P 263-273
%Z Columns: Formal Language Theory

%A B. Gramlich
%T A Note on a Parameterized Version of the Well-Founded Induction Principle
%J |BEATCS|
%V 52
%D february 1994
%P 274-278
%Z Technical Contributions

%A I. Hodkinson
%T Addendum to: Finite Variable Logics
%J |BEATCS|
%V 52
%D february 1994
%P 278-279
%Z Technical Contributions

%A A.K. Seda
%T Some Applications of General Topology to the Semantics of Logic Programs
%J |BEATCS|
%V 52
%D february 1994
%P 279-292
%Z Technical Contributions

%A R. Selj\'ee
%T Integrity Constraint Checking for Updates in Deductive Databases; a different approach
%J |BEATCS|
%V 52
%D february 1994
%P 292-314
%Z Technical Contributions
%U 

%A Y. Auramo
%A J. Katajainen
%A J. Kulmala
%T Finding the Maximum in Parallel Random Access Machines
%J |BEATCS|
%V 52
%D february 1994
%P 315-334
%Z Surveys and Tutorials

%A J. Printz
%T Mathematical Training for the Software Developers: A Practical Experience
%J |BEATCS|
%V 52
%D february 1994
%P 335-373
%Z Educational Matters

%A J. Padberg
%T Algebraic high-level net transformation systems: a survey over theory and applications
%J |BEATCS|
%V 51
%D october 1993
%P 102-110
%Z Columns: Algebraic Specification

%A I. Hodkinson
%T Finite variable logics
%J |BEATCS|
%V 51
%D october 1993
%P 111-140
%Z Columns: Logic in Computer Science
%U http://www.doc.ic.ac.uk/\~imh/noframes_website/yuri.html

%A J.F. Traub
%A H. Wozniakowski
%T Recent progress in information-based complexity
%J |BEATCS|
%V 51
%D october 1993
%P 141-154
%Z Columns: Structural Complexity

%A S. Christensen
%A H. H\"uttel
%T Decidability issues for infinite-state processes - a survey
%J |BEATCS|
%V 51
%D october 1993
%P 156-166
%Z Columns: Concurrency

%A T. Harju
%A H.C.M. Kleijn
%T Morphisms and rational transducers
%J |BEATCS|
%V 51
%D october 1993
%P 168-180
%Z Columns: Formal Language Theory

%A L. Kari
%T Insertion operations: closure properties
%J |BEATCS|
%V 51
%D october 1993
%P 181-191
%Z Columns: Formal Language Theory

%A M. Baaz
%A C.G. Ferm\"uller
%A R. Zach
%T Dual systems of sequents and tableaux for many-valued logics
%J |BEATCS|
%V 51
%D october 1993
%P 192-197
%Z Technical Contributions

%A E. Csuhaj-Varj\'u
%A G. P\v{a}un
%T Limiting the team size in cooperating grammar systems
%J |BEATCS|
%V 51
%D october 1993
%P 198-202
%Z Technical Contributions

%A V. Domocos
%T The generating function of completely bracketed expressions
%J |BEATCS|
%V 51
%D october 1993
%P 202-211
%Z Technical Contributions

%A R. Freivalds
%A E. Kinber
%A C.H. Smith
%T On the impact of forgetting on learning machines
%J |BEATCS|
%V 51
%D october 1993
%P 212-225
%Z Technical Contributions

%A X.-L. Hu
%T The representation of a program in the Blum-Shub-Smale theory of computation over an arbitrary ring
%J |BEATCS|
%V 51
%D october 1993
%P 226-228
%Z Technical Contributions

%A A. Rensink
%T Order isomorphism does not preserve global event independence
%J |BEATCS|
%V 51
%D october 1993
%P 228-235
%Z Technical Contributions

%A P. Flor\'een
%T A short introduction to neural associative memories
%J |BEATCS|
%V 51
%D october 1993
%P 236-245
%Z Surveys and Tutorials

%A D.L. Parnas
%T Mathematics of computation for (software and other) engineers
%J |BEATCS|
%V 51
%D october 1993
%P 249-259
%Z Educational Matters

%A J. Printz
%T Mathematical training for the software developers: a practical experience
%J |BEATCS|
%V 51
%D october 1993
%P 260-264
%Z Educational Matters

%A A. Fett
%A C. Gerke
%A W. Grieskamp
%A P. Pepper
%T Algebraic Programming in OPAL
%J |BEATCS|
%V 50
%D June 1993
%P 171-181
%Z Columns: Algebraic Specification

%A M. Nielsen
%T The Concurrency Column
%J |BEATCS|
%V 50
%D June 1993
%P 182-185
%Z Columns: Concurrency

%A K. Salomaa
%A S. Yu
%T Limited nondeterminism for pushdown automata
%J |BEATCS|
%V 50
%D June 1993
%P 186-193
%Z Columns: Formal Language Theory

%A A. Carpi
%T Repetitions in the Kolakovski sequence
%J |BEATCS|
%V 50
%D June 1993
%P 194-196
%Z Technical Contributions

%A V. Domocos
%A F. Hristea
%T A codification of column-convex polyominoes which generates a regular language
%J |BEATCS|
%V 50
%D June 1993
%P 197-208
%Z Technical Contributions

%A F. Drewes
%A A. Habel
%A H.-J. Kreowski
%A S. Taubenberger
%T A Sketch of Collage Grammars
%J |BEATCS|
%V 50
%D June 1993
%P 209-219
%Z Technical Contributions

%A H.D. Gr\"oger
%A Gy. Tur\'an
%T A linear lower bound for the size of threshold circuits
%J |BEATCS|
%V 50
%D June 1993
%P 220-222
%Z Technical Contributions

%A J. Jedrzejowicz
%T Remark on shuffle identities
%J |BEATCS|
%V 50
%D June 1993
%P 222-223
%Z Technical Contributions

%A E. Ohlebusch
%T A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems
%J |BEATCS|
%V 50
%D June 1993
%P 223-228
%Z Technical Contributions
%U ftp://ftp.uni-bielefeld.de/pub/papers/techfak/pi/EATCS93.ps.gz

%A G. P\v{a}un
%T Remarks concerning self-reading sequences
%J |BEATCS|
%V 50
%D June 1993
%P 229-233
%Z Technical Contributions

%A Z. Pawlak
%T Anatomy of conflicts
%J |BEATCS|
%V 50
%D June 1993
%P 234-247
%Z Technical Contributions

%A L. Priese
%T Fairness, part II
%J |BEATCS|
%V 50
%D June 1993
%P 247-259
%Z Technical Contributions

%A A. Raspaud
%T Good and semi-strong colorings of oriented planar graphs
%J |BEATCS|
%V 50
%D June 1993
%P 260-263
%Z Technical Contributions

%A A. Skowron
%A Z. Suraj
%T A rough set approach to real-time state identification
%J |BEATCS|
%V 50
%D June 1993
%P 264-275
%Z Technical Contributions

%A F. Urbanek
%T A simple lambda-term representing the predecessor function with respect to church numerals
%J |BEATCS|
%V 50
%D June 1993
%P 276-279
%Z Technical Contributions

%A G.J. Chaitin
%T Randomness in arithmetic and the decline and fall or reductionism in pure mathematics
%J |BEATCS|
%V 50
%D June 1993
%P 314-328
%Z Surveys and Tutorials
%U http://arxiv.org/abs/chao-dyn/9304002

%A H.-J. Kreowski
%T Educational Matters
%J |BEATCS|
%V 50
%D June 1993
%P 329-331
%Z Educational Matters

%A M. Navarro
%A F. Orejas
%A A. Sanchez
%T Characterizing Confusion
%J |BEATCS|
%V 49
%D february 1993
%P 104-109
%Z Columns: Algebraic Specification

%A B. Courcelle
%T Graphs and Monadic Second-Order Logic: Some Open Problems
%J |BEATCS|
%V 49
%D february 1993
%P 110-124
%Z Columns: Logic in Computer Science

%A J. Hartmanis
%T A Broader Research Agenda for Theory
%J |BEATCS|
%V 49
%D february 1993
%P 125-129
%Z Columns: Structural Complexity

%A A. Mateescu
%T The Splendour of an Old Ballad: Aad van Wijngaarden Grammars
%J |BEATCS|
%V 49
%D february 1993
%P 130-142
%Z Columns: Formal Language Theory

%A M. Buro
%A H. Kleine B\"uning
%T Report on a SAT Competition
%J |BEATCS|
%V 49
%D february 1993
%P 143-151
%Z Technical Contributions

%A J. Dassow
%A G. P\v{a}un
%A A. Salomaa
%T On Thinness and Slenderness of L Languages
%J |BEATCS|
%V 49
%D february 1993
%P 152-158
%Z Technical Contributions

%A P. Gvozdjak
%T One Letter Context-Free Languages Revisited
%J |BEATCS|
%V 49
%D february 1993
%P 159-162
%Z Technical Contributions

%A E. M\"akinen
%T A Note on Gupta's Binary Tree Codings
%J |BEATCS|
%V 49
%D february 1993
%P 163-164
%Z Technical Contributions

%A I. Maung
%T On Specialization HIerarchies of Mutable Objects
%J |BEATCS|
%V 49
%D february 1993
%P 165-174
%Z Technical Contributions

%A V. Mitrana
%T Some Remarks on P\v{a}un-Salomaa Sequences
%J |BEATCS|
%V 49
%D february 1993
%P 175-177
%Z Technical Contributions

%A E. Ohlebusch
%T A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems
%J |BEATCS|
%V 49
%D february 1993
%P 178-183
%Z Technical Contributions

%A G. P\v{a}un
%T How much Thue is Kolakovski?
%J |BEATCS|
%V 49
%D february 1993
%P 183-185
%Z Technical Contributions

%A W. Reisig
%T Petri Nets: Fundamentals, Essentials, Consequences
%J |BEATCS|
%V 49
%D february 1993
%P 185-191
%Z Technical Contributions

%A S. Vicolov
%T Infinite Hierarchies of Valence Languages
%J |BEATCS|
%V 49
%D february 1993
%P 192-194
%Z Technical Contributions

%A C.G. Diderich
%T A bibliography on Minimax Trees
%J |BEATCS|
%V 49
%D february 1993
%P 195-200
%Z Bibliographies

%A S. English
%A R. Bosworth
%A D. Simpson
%T Concurrency Clich\'es in CCS and CPN
%J |BEATCS|
%V 49
%D february 1993
%P 202-204
%Z Educational Matters

%A G. Scollo
%T Algebra in the New UT Informatica
%J |BEATCS|
%V 49
%D february 1993
%P 205-209
%Z Educational Matters

%A J. Goguen
%A R. Diaconescu
%T A short Oxford survey of order sorted algebra
%J |BEATCS|
%V 48
%D october 1992
%P 121-133
%Z Columns: Algebraic Specification

%A K.J. Compton
%A H. Straubing
%T Characterizations of regular languages in low level complexity classes
%J |BEATCS|
%V 48
%D october 1992
%P 134-142
%Z Columns: Logic in Computer Science

%A G. P\v{a}un
%T VALENCES: Increasing the power of grammars, transducers, grammar systems
%J |BEATCS|
%V 48
%D october 1992
%P 143-156
%Z Formal Language Theory

%A M. Baaz
%A R. Zach
%T Note on calculi for a three-valued logic for logic programming
%J |BEATCS|
%V 48
%D october 1992
%P 157-164
%Z Technical Contributions

%A J. Cassaigne
%A S. Schwer
%A P. S\'e\'ebold
%T About Gauss codes
%J |BEATCS|
%V 48
%D october 1992
%P 165-171
%Z Technical Contributions

%A M. Droste
%A R.M. Shortt
%T Bounded Petri nets of finite dimension have only finitely many reachable markings
%J |BEATCS|
%V 48
%D october 1992
%P 172-175
%Z Technical Contributions

%A L. Libkin
%T An elementary proof that upper and lower powerdomain constructions commute
%J |BEATCS|
%V 48
%D october 1992
%P 175-177
%Z Technical Contributions

%A Z. Pawlak
%T Concurrent versus sequential - the rough sets perspective
%J |BEATCS|
%V 48
%D october 1992
%P 178-190
%Z Technical Contributions

%A M. Steinby
%T On generalizations of the Nerode and Myhill theorems
%J |BEATCS|
%V 48
%D october 1992
%P 191-196
%Z Technical Contributions

%A S. V\'agv\"oglgyi
%A R. Gilleron
%T For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizable
%J |BEATCS|
%V 48
%D october 1992
%P 197-209
%Z Technical Contributions

%A A.A. Muchnik
%T Games on infinite trees and automata with dead-ends: a new proof for the decidability of the monadic second order theory of two successors
%J |BEATCS|
%V 48
%D october 1992
%P 220-267
%Z Surveys and Tutorials

%A N. Chapman
%T Teaching theoretical computer science to first year undergraduates
%J |BEATCS|
%V 48
%D october 1992
%P 269-273
%Z Educational Matters

%A V. Bruy\`ere
%T Research topics in the theory of codes
%J |BEATCS|
%V 48
%D october 1992
%P 412-424
%Z Problems and Solutions

%A H. Ehrig
%T Some important new facts supporting the development of algebraic specifications
%J |BEATCS|
%V 47
%D june 1992
%P 135-137
%Z Columns: Algebraic Specification

%A P.S. Subramanian
%T Towards an algebraic specification framework for the VLSI design process
%J |BEATCS|
%V 47
%D june 1992
%P 137-143
%Z Columns: Algebraic Specification

%A J. Hartmanis
%A R. Chang
%A S. Chari
%A D. Ranjan
%A P. Rohatgi
%T Relativization: a revisionistic retrospective
%J |BEATCS|
%V 47
%D june 1992
%P 144-153
%Z Columns: Structural Complexity
%U http://www.csee.umbc.edu/\~chang/papers/revisionist/
%%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column47.ps

%A A. Salomaa
%T What Emil said about the Post correspondence problem
%J |BEATCS|
%V 47
%D june 1992
%P 154-165
%Z Columns: Formal Language Theory

%A A. Arnold
%A A. Dicky
%A M. Nivat
%T A note about minimal non-deterministic automata
%J |BEATCS|
%V 47
%D june 1992
%P 166-169
%Z Technical Contributions

%A D. Kozen
%T On the Myhill-Nerode theorem for trees
%J |BEATCS|
%V 47
%D june 1992
%P 170-173
%Z Technical Contributions

%A V. Mitrana
%T Valence grammars on a free generated group
%J |BEATCS|
%V 47
%D june 1992
%P 174-179
%Z Technical Contributions

%A H. Prodinger
%T Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters
%J |BEATCS|
%V 47
%D june 1992
%P 180-199
%Z Technical Contributions

%A A. Renvall
%T ANDOS: A simple protocol for secret selling of secrets
%J |BEATCS|
%V 47
%D june 1992
%P 200-205
%Z Technical Contributions

%A F. Urbanek
%T A note on the language operator ``red''
%J |BEATCS|
%V 47
%D june 1992
%P 205-206
%Z Technical Contributions

%A J.P.M. de Vreught
%T Maximal derivation lengths of acyclic CFGs
%J |BEATCS|
%V 47
%D june 1992
%P 206-207
%Z Technical Contributions

%A H.-J. Kreowski
%T Educational Matters
%J |BEATCS|
%V 47
%D june 1992
%P 208-214
%Z Educational Matters

%A Z. Galil
%T Obituary Renato Capocelli
%J |BEATCS|
%V 47
%D june 1992
%P 427
%Z Obituaries

%A M. Gro{\ss}e-Rhode
%T Restriction Constructions in Specification Logics
%J |BEATCS|
%V 46
%D february 1992
%P 84-89
%Z Columns: Algebraic Specification

%A Y. Gurevich
%T Zero-One Laws
%J |BEATCS|
%V 46
%D february 1992
%P 90-106
%Z Columns: Logic in Computer Science
%U http://research.microsoft.com/\~gurevich/Opera/95.ps

%A L.A. Hemachandra
%A M. Ogiwara
%T Is #P Closed under Substraction?
%J |BEATCS|
%V 46
%D february 1992
%P 107-122
%Z Columns: Structural Complexity

%A L. Kari
%A S. Marcus
%A G. P\v{a}un
%A A. Salomaa
%T In the prehistory of formal language theory: Gauss Languages
%J |BEATCS|
%V 46
%D february 1992
%P 124-139
%Z Columns: Formal Language Theory

%A N.P. Chapman
%T On Extended Attribute Grammars
%J |BEATCS|
%V 46
%D february 1992
%P 140-146
%Z Technical Contributions

%A E. M\"akinen
%T A note on Graftings, Rotations, and Distances in Binary Trees
%J |BEATCS|
%V 46
%D february 1992
%P 146-148
%Z Technical Contributions

%A C. Meinel
%T Branching Programs - An Efficient Data Structure for Computer-Aided Circuit Design
%J |BEATCS|
%V 46
%D february 1992
%P 149-170
%Z Technical Contributions

%A G. P\v{a}un
%A A. Salomaa
%T Decision Problems Concerning the Thinness of DOL Languages
%J |BEATCS|
%V 46
%D february 1992
%P 171-181
%Z Technical Contributions

%A J. Shallit
%A D. Wilson
%T The ``3x +1'' Problem and Finite Automata
%J |BEATCS|
%V 46
%D february 1992
%P 182-185
%Z Technical Contributions

%A F. Urbanek
%T Next Star is Always
%J |BEATCS|
%V 46
%D february 1992
%P 186-187
%Z Technical Contributions

%A P.A.S. Veloso
%T Yet Another Cautionary Note on Conservative Extensions: a Simple Case with a Computing Flavour
%J |BEATCS|
%V 46
%D february 1992
%P 188-192
%Z Technical Contributions

%A B. Courcelle
%T Graph Grammars, Monadic Second-Order Logic and the Theory of Graph Minors
%J |BEATCS|
%V 46
%D february 1992
%P 193-226
%Z Surveys and Tutorials

%A J. Bergstra
%T Obituary Wolfgang Wechler
%J |BEATCS|
%V 46
%D february 1992
%P 384

%A F. Parisi Presicce
%A A. Pierantonio
%T Towards the Algebraic Specification of Classes in Object Oriented Programming
%J |BEATCS|
%V 45
%D october 1991
%P 86-97
%Z Columns: Algebraic Specification

%A C.A. Gunter
%T Forms of Semantic Specification
%J |BEATCS|
%V 45
%D october 1991
%P 98-113
%Z Columns: Logic in Computer Science

%A A.L. Selman
%T Complexity Classes for Partial Functions
%J |BEATCS|
%V 45
%D october 1991
%P 114-130
%Z Columns: Structural Complexity

%A J. Dassow
%A J. Kelemen
%T Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence
%J |BEATCS|
%V 45
%D october 1991
%P 131-145
%Z Columns: Formal Language Theory

%A V. Akman
%T Undaunted Sets
%J |BEATCS|
%V 45
%D october 1991
%P 146-147
%Z Technical Contributions

%A C. Choffrut
%T Conjugacies
%J |BEATCS|
%V 45
%D october 1991
%P 148-157
%Z Technical Contributions

%A P. Inverardi
%A C. Priami
%T Evaluation of Tools for the Analysis of Communicating Systems
%J |BEATCS|
%V 45
%D october 1991
%P 158-185
%Z Technical Contributions

%A Z. F\"ul\"op
%A S. V\'agv\"olgyi
%T Ground Term Rewriting Rules for the Word Problem of Ground Term Equations
%J |BEATCS|
%V 45
%D october 1991
%P 186-201
%Z Technical Contributions

%A J. Leuchner
%A L. Miller
%A G. Slutzki
%T Agreement Graph Dependencies
%J |BEATCS|
%V 45
%D october 1991
%P 202-217
%Z Technical Contributions

%A G. P\v{a}un
%T A Characterization of Recursively Enumerable Languages
%J |BEATCS|
%V 45
%D october 1991
%P 218-222
%Z Technical Contributions

%A P. Turakainen
%T A Unified Approach to Characterization of Recursively Enumerable Languages
%J |BEATCS|
%V 45
%D october 1991
%P 223-228
%Z Technical Contributions

%A D. Turner
%T Duality and De Morgan Laws for the Algebra of Lists
%J |BEATCS|
%V 45
%D october 1991
%P 229-237
%Z Technical Contributions

%A J.J.-Ch. Meyer
%A W. van der Hoek
%A G.A.W. Vreeswijk
%T Epistemic Logic for Computer Science: A Tutorial (part two)
%J |BEATCS|
%V 45
%D october 1991
%P 256-287
%Z Surveys and Tutorials

%A H. Ehrig
%A M. Baldamus
%A F. Orejas
%T Amalgamation and Extension in the Framework of Specification Logics and Generalized Morphisms
%J |BEATCS|
%V 44
%D june 1991
%P 129-143
%Z Columns: Algebraic Specification

%A H.-J. Kreowski
%T Arguments for an IFIP Working Group on Mathematical Aspects of Systems Specification
%J |BEATCS|
%V 44
%D june 1991
%P 144-146
%Z Columns: Algebraic Specification

%A K. Kunen
%T Declarative Semantics of Logic Programming
%J |BEATCS|
%V 44
%D june 1991
%P 147-167
%Z Columns: Logic in Computer Science

%A V. Niemi
%T Density in discrete systems
%J |BEATCS|
%V 44
%D june 1991
%P 168-175
%Z Columns: Formal Language Theory

%A B. Courcelle
%T On Constructing Obstruction Sets of Words
%J |BEATCS|
%V 44
%D june 1991
%P 178-185
%Z Technical Contributions

%A Ph. Darondeau
%T Recursive Graphs are not Stable under Maximal Reduction
%J |BEATCS|
%V 44
%D june 1991
%P 186-189
%Z Technical Contributions

%A O.H. Ibarra
%T On Resetting DLBA's
%J |BEATCS|
%V 44
%D june 1991
%P 190-191
%Z Technical Contributions

%A D. Murphy
%T The Physics of Observation: a Perspective for Concurrency Theorists
%J |BEATCS|
%V 44
%D june 1991
%P 192-200
%Z Technical Contributions

%A Z. Pawlak
%T Decision Logic
%J |BEATCS|
%V 44
%D june 1991
%P 201-225
%Z Technical Contributions

%A A. Salomaa
%A K. Salomaa
%A S. Yu
%T Primality Types of Instances of the Post Correspondence Problem
%J |BEATCS|
%V 44
%D june 1991
%P 226-241
%Z Technical Contributions

%A J.J.-Ch. Meyer
%A W. van der Hoek
%A G.A.W. Vreeswijk
%T Epistemic Logic for Computer Science: A Tutorial (part one)
%J |BEATCS|
%V 44
%D june 1991
%P 242-270
%Z Surveys and Tutorials

%A H. Ehrig
%A H. Adametz
%T New Compatibility Results for Implementations within the Initial Algebraic Approach
%J |BEATCS|
%V 43
%D february 1991
%P 131-112
%Z Columns: Algebraic Specification

%A K.J. Compton
%T Lower Bounds for the Complexity of Theories
%J |BEATCS|
%V 43
%D february 1991
%P 113-123
%Z Columns: Algebraic Specification

%A A. Salomaa
%T L Codes and L Systems with Immigration
%J |BEATCS|
%V 43
%D february 1991
%P 124-130
%Z Columns: Formal Language Theory

%A D.T. Barnard
%A J.P. Schmeiser
%A D.B. SDkilicorn
%T Deriving Associative Operators for Language Recognition
%J |BEATCS|
%V 43
%D february 1991
%P 131-139
%Z Technical Contributions

%A A. Bertoni
%A P. Campadelli
%A G. Mauri
%T Some Notes on Computational Learning Theory
%J |BEATCS|
%V 43
%D february 1991
%P 140-158
%Z Technical Contributions

%A S.L. Bloom
%A Z. Esik
%T Cayley iff Stone
%J |BEATCS|
%V 43
%D february 1991
%P 159-161
%Z Technical Contributions

%A N. Dershowitz
%A J.-P. Jouannaud
%T Notations for Rewriting
%J |BEATCS|
%V 43
%D february 1991
%P 162-172
%Z Technical Contributions

%A R. Giegerich
%A E. Ohlebusch
%T An Implicit Representation of Infinite Sequences of Terms
%J |BEATCS|
%V 43
%D february 1991
%P 173-182
%Z Technical Contributions

%A R. Parikh
%T Dumb-Founded Sets
%J |BEATCS|
%V 43
%D february 1991
%P 183-184
%Z Technical Contributions

%A I.A. Stewart
%T Obtaining Nielsen Reduced Sets in Free Groups
%J |BEATCS|
%V 43
%D february 1991
%P 184-188
%Z Technical Contributions

%A P.A.S. Veloso
%A S.R.M. Veloso
%T Some Remarks on Conservative Extensions: A Socratic Dialogue
%J |BEATCS|
%V 43
%D february 1991
%P 189-198
%Z Technical Contributions

%A J.A. Brzozowski
%A C.-J.H. Seger
%T Advances in Asynchronous Circuit Theory Part II: Bounded Inertial Delay Models, MOS Circuits, Design Techniques
%J |BEATCS|
%V 43
%D february 1991 
%P 199-263
%Z Surveys and Tutorials

%A Y. Gurevich
%T Evolving Algebras, A Tutorial Introduction
%J |BEATCS|
%V 43
%D february 1991 
%P 264-284
%Z Surveys and Tutorials
%U http://research.microsoft.com/\~gurevich/Opera/92.ps

%A D. Spencer
%T A Survey of Categorical Computation: Fixed Points, Partiality, Combinators ... Control?
%J |BEATCS|
%V 43
%D february 1991
%P 285-312
%Z Surveys and Tutorials

%A H. Edelsbrunner
%T The Computational Geometry Column
%J |BEATCS|
%V 42
%D october 1990
%P 132-134
%Z Columns: Computational Geometry

%A H. Ehrig
%A M.A. Arbib
%T Linking Schemas and Module Specifications: a Proposal
%J |BEATCS|
%V 42
%D october 1990
%P 136-139
%Z Columns: Algebraic Specification

%A Y. Gurevich
%T On the Classical Decision Problem
%J |BEATCS|
%V 42
%D october 1990
%P 140-150
%Z Columns: Logic in Computer Science
%U http://research.microsoft.com/\~gurevich/Opera/91.ps

%A R. Chang
%A P. Rohatgi
%T On Unique Satisfiability and Randomized Reductions
%J |BEATCS|
%V 42
%D october 1990
%P 151-159
%Z Columns: Structural Complexity
%U http://www.csee.umbc.edu/\~chang/papers/usat-col/
%%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column42.ps

%A L. Santean
%T Parallel Communicating Systems
%J |BEATCS|
%V 42
%D october 1990
%P 160-171
%Z Columns: Formal Language Theory

%A R. Chang
%T An Example of a Theorem that has Contradictory Relativizations and a Diagonalization Proof
%J |BEATCS|
%V 42
%D october 1990
%P 172-173
%Z Technical Contributions
%U http://www.csee.umbc.edu/\~chang/papers/contra/

%A A. Lingas
%T A Note on a Parallel Heuristic for Minimum Vertex Cover
%J |BEATCS|
%V 42
%D october 1990
%P 174-177
%Z Technical Contributions

%A A. Salomaa
%A L. Santean
%T Secret Selling of Secrets with Several Buyers
%J |BEATCS|
%V 42
%D october 1990
%P 178-186
%Z Technical Contributions

%A R. Socher-Ambrosius
%T Another Technique for Proving Completeness of Ground Resolution
%J |BEATCS|
%V 42
%D october 1990
%P 187-189
%Z Technical Contributions

%A I.A. Stewart
%T On the Graph Accessibility Problem for Directed Graphs of Bounded Degree
%J |BEATCS|
%V 42
%D october 1990
%P 190-193
%Z Technical Contributions

%A F. Urbanek
%T A Simple Completeness Proof for Early's Algorithm
%J |BEATCS|
%V 42
%D october 1990
%P 194
%Z Technical Contributions

%A R. Whitty
%T An Exercise in Weakest Preconditions
%J |BEATCS|
%V 42
%D october 1990
%P 195-197
%Z Technical Contributions

%A J.A. Brzozowski
%A C.-J.H. Seger
%T Advances in Asynchronous Circuit Theory, Part I: Gate and Unbounded Inertial Delay Models
%J |BEATCS|
%V 42
%D october 1990
%P 198-249
%Z Surveys and Tutorials

%A D. Sanella
%A A. Tarlecki
%T Algebraic specification and formal methods for program development: what are the real problems?
%J |BEATCS|
%V 41
%D june 1990
%P 134-137
%Z Columns: Algebraic Specification

%A H. Ehrig
%T ESF-concepts linked with algebraic module specifications
%J |BEATCS|
%V 41
%D june 1990
%P 138-144
%Z Columns: Algebraic Specification

%A H. Ehrig
%A I. Cla\ssen
%T Overview of algebraic specification languages, environments and tools, and algebraic specifications of software systems
%J |BEATCS|
%V 41
%D june 1990
%P 145-153
%Z Columns: Algebraic Specification

%A A. Scedrow
%T A brief guide to linear logic
%J |BEATCS|
%V 41
%D june 1990
%P 154-165
%Z Columns: Logic in Computer Science

%A H. Hartmanis
%A R. Chang
%A D. Ranjan
%A P. Rohatgi
%T On IP = PSPACE and theorems with narrow proofs
%J |BEATCS|
%V 41
%D june 1990
%P 166-174
%Z Columns: Structural Complexity
%U http://www.csee.umbc.edu/\~chang/papers/width/
%%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column41.ps

%A A. Salomaa
%T Decidability in finite automata
%J |BEATCS|
%V 41
%D june 1990
%P 175-183
%Z Columns: Formal Language Theory

%A R. Assous
%A C. Charetton
%T Nice labelling of event structures
%J |BEATCS|
%V 41
%D june 1990
%P 184-190
%Z Technical Contributions

%A G. Beltrame
%A M. Staniszkis
%T The generalized prefix property
%J |BEATCS|
%V 41
%D june 1990
%P 191-196
%Z Technical Contributions

%A P. Byers
%A D. Pitt
%T Conservative extensions: a cautionary note
%J |BEATCS|
%V 41
%D june 1990
%P 196-201
%Z Technical Contributions

%A G. Gambosi
%A A. Postiglione
%A M. Talamo
%T On the average performance of some algorithms for on-line bin-packing
%J |BEATCS|
%V 41
%D june 1990
%P 202-209
%Z Technical Contributions

%A G. Kant
%A J. van Leeuwen
%T On special multiples of integers
%J |BEATCS|
%V 41
%D june 1990
%P 210-211
%Z Technical Contributions

%A J. Katajainen
%A E. M\"akinen
%T A note on the complexity of trie compaction
%J |BEATCS|
%V 41
%D june 1990
%P 212-216
%Z Technical Contributions

%A E. Kounalis
%A M. Rusinowitch
%T Mechanizing inductive reasoning
%J |BEATCS|
%V 41
%D june 1990
%P 216-226
%Z Technical Contributions

%A R. Milner
%A F. Moller
%T Unique decomposition of processes
%J |BEATCS|
%V 41
%D june 1990
%P 226-232
%Z Technical Contributions

%A N. Nirmal
%A R. Rama
%T Note on (EOL-EOL) array systems
%J |BEATCS|
%V 41
%D june 1990
%P 233-239
%Z Technical Contributions

%A H. Imai
%T Computation Geometry: Research in Japan
%J |BEATCS|
%V 40
%D february 1990
%P 164-167
%Z Columns: Computational Geometry

%A J. Loeckx
%T The Specification System OBSCURE
%J |BEATCS|
%V 40
%D february 1990
%P 169-171
%Z Columns: Computational Geometry

%A H. Ehrig
%A I. Classen
%T Overview of Algebraic Specification Languages Environments and Tools, and Algebraic specifications of Software Systems
%J |BEATCS|
%V 40
%D february 1990
%P 172-181
%Z Columns: Computational Geometry

%A E.W. Allender
%A K.W. Wagner
%T Counting Hierarchies: Polynomial Time and Constant Depth Circuits
%J |BEATCS|
%V 40
%D february 1990
%P 182-194
%Z Columns: Structural Complexity
%%U ftp://ftp.cs.rutgers.edu/pub/allender/wagner.eatcs.ps.Z
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column40.ps

%A J. Kari
%T Games played on the plane: Solitaire and Cellular Automata
%J |BEATCS|
%V 40
%D february 1990
%P 195-200
%Z Columns: Formal Language Theory

%A R. Backhouse
%A G. Malcolm
%T On induced congruences
%J |BEATCS|
%V 40
%D february 1990
%P 201-206
%Z Technical Contributions

%A J. Van den Bussche
%T A formal basis for extending SQL to object-oriented databases
%J |BEATCS|
%V 40
%D february 1990
%P 207-216
%Z Technical Contributions

%A C. Choffrut
%T An optimal algorithm for building the Boyer-Moore automaton
%J |BEATCS|
%V 40
%D february 1990
%P 217-225
%Z Technical Contributions

%A M. Formann
%A G. W\"oginger
%T On the reconstruction of simple polygons
%J |BEATCS|
%V 40
%D february 1990
%P 225-230
%Z Technical Contributions

%A M. Gogolla
%T A note on the translation of SQL tuple calculus
%J |BEATCS|
%V 40
%D february 1990
%P 231-236
%Z Technical Contributions

%A W. Loch
%T On the equivalence problem for DTOL systems
%J |BEATCS|
%V 40
%D february 1990
%P 237-246
%Z Technical Contributions

%A H. Marxen
%A J. Buntrock
%T Attacking the Busy Beaver 5
%J |BEATCS|
%V 40
%D february 1990
%P 247-251
%Z Technical Contributions

%A E. Ochmanski
%T Notes on a star mystery
%J |BEATCS|
%V 40
%D february 1990
%P 252-257
%Z Technical Contributions

%A G. P\v{a}un
%T Non-centralized parallel communicating grammar systems
%J |BEATCS|
%V 40
%D february 1990
%P 257-264
%Z Technical Contributions

%A G. Ricci
%T Most definitions of trees over an alphabet are wrong
%J |BEATCS|
%V 40
%D february 1990
%P 265
%Z Technical Contributions

%A A. Szepietowski
%T Weak mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] = > [L = NL]
%J |BEATCS|
%V 40
%D february 1990
%P 266-269
%Z Technical Contributions

%A P. Turakainen
%T On the finiteness of the multiplicative monoid generated by a nonnegative matrix
%J |BEATCS|
%V 40
%D february 1990
%P 270-272
%Z Technical Contributions

%A J.H. Gallier
%A W. Snyder
%T Designing unification procedures
%J |BEATCS|
%V 40
%D february 1990
%P 273-326
%Z Surveys and Tutorials

%A V. Diekert
%T Research topics in the theory of free partially commutative monoids
%J |BEATCS|
%V 40
%D february 1990
%P 479-491
%Z Problems and Solutions

%A B. Thalheim
%T Open problems presented at the symposium ``Mathematical Fundamentals of Database Systems'' MFDBS-89 in Visegrad, Hungary
%J |BEATCS|
%V 40
%D february 1990
%P 492-501
%Z Problems and Solutions

%A G. Rozenberg
%A A. Salomaa
%T Aristid Lindenmayer in Memoriam
%J |BEATCS|
%V 40
%D february 1990
%P 509-510

%T Memories of ADJ
%A Josesph A. Goguen
%P 97-102
%Z Columns: Algebraic Specification
%J |BEATCS|
%D october 1989
%V 39
 
%T Overview of Algebraic Specification Languages, Environments and Tools
   and Algebraic Specifications of Software Systems (Part 1)
%A Hartmut Ehrig
%A Ingo Cla{\ss}en
%P 103-111
%Z Columns: Algebraic Specification
%J |BEATCS|
%D october 1989
%V 39

%A Yuri Gurevich
%T The Challenger-Solver Game: Variations on the Theme of P =? NP
%P 112-121
%Z Columns: Logic in Computer Science
%J |BEATCS|
%D october 1989
%V 39

%A Ronald V. Book
%A Osamu Watanabe
%T A View of Structural Complexity Theory
%P 122-138
%Z Columns: Structural Complexity
%J |BEATCS|
%D october 1989
%V 39

%T Decision Procedures for Elementary Sublanguages of Set Theory.
   XVI. Multilevel Syllogistic Extended by Singleton, Rank Comparison
   and Unary Intersection
%A D. Cantone
%A V. Cutello
%P 139-148
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T String-Matching and Periods
%A Maxime Crochemore
%P 149-153
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T The Knowledge on Information Content of Problems Provides Much Useful
   Information to Circuit Designers
%A Juraj Hromkovi\v{c}
%P 154-171
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T A Positive Pumping Condition for Regular Sets
%A Aldo de Luca
%A Stefano Varricchio
%P 171-175
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T Congruential Tree Languages are the Same as Recognizable Tree Languages
   -- A Proof for a Theorem of D.~Kozen
%A Z. F\"ul\"op
%A S. V\'agv\"olgyi
%P 175-185
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T Well Quasi-Ordering in a Paper by Maurice Janet
%A Pierre Lescanne
%P 185-188
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T A Curious Grammar
%A Alexander Ollongren
%P 189-196
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T Bisimulation as Cointersection
%A Axel Poign\'e
%P 197-198
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T The Evidence Theory and Decision Tables
%A A. Skowron
%P 199-204
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T On Minimizing Finite Automata
%A F. Urbanek
%P 205-206
%Z Technical Contributions
%J |BEATCS|
%D october 1989
%V 39

%T Research Topics in Computational Geometry
%A Alok Aggarwal
%P 388-409
%Z Problems and Solutions
%J |BEATCS|
%D october 1989
%V 39

%Z Columns: Computational Geometry
%A Herbert Edelsbrunner
%T ( Non-Obtuse Triangulations \& Stabbing Triangles )
%P 74-78
%J |BEATCS|
%D june 1989
%V 38

%Z Columns: Algebraic Specification
%A Hartmut Ehrig
%P 79-92
%T ( Concepts for Transformations and Implementations of Specifications )
%J |BEATCS|
%D june 1989
%V 38

%Z Columns: Logic in Computer Science
%A Yuri Gurevich
%T Infinite Games
%P 93-100
%J |BEATCS|
%D june 1989
%V 38
%U http://research.microsoft.com/\~gurevich/Opera/84.ps

%Z Columns: Structural Complexity
%A Juris Hartmanis
%T G\"odel, von Neumann and the P =? NP Problem
%P 101-107
%J |BEATCS|
%D june 1989
%V 38
%%U http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cornell/TR89-994
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column38.ps

%Z Columns: Formal Language Theory
%A Arto Salomaa
%T Knapsacks and Superdogs
%P 107-123
%J |BEATCS|
%D june 1989
%V 38

%T Recognizable Sets of Finite Bilabelled Transition Systems
%A Andr\'e Arnold
%P 123-135
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T On Minimal Finite Automata - Corrigenda
%A Marek A. Bednarczyk
%P 135-136
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Atomic Actions (note)
%A G\'erard Boudol
%P 136-144
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions
%U http://www-sop.inria.fr/mimosa/personnel/Gerard.Boudol/rr1026.html

%T A New Approach to the Jeep Problem
%A Ute Brauer
%A Wilfried Brauer
%P 145-154
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Partial Orders Semantics for Refinement of Actions --
   neither necessary nor always sufficient but appropriate when used with care
%A Rob van Glabbeek
%A Ursula Goltz
%P 154-163
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Extensions of Top-Down Tree-to-String Transductions
%A Wolfgang Golubski
%A Wolfram-M. Lippe
%P 164-168
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T An Undecidability Result for Regular Languages and its Applications to Regulated Rewriting
%A Friedhelm Hinz
%A J\"urgen Dassow
%P 168-173
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Memory and Algebra
%A C. Jousselin
%A J-P. Moskowitz
%P 174-180
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Optimal Packing of Similar Triangles
%A Evangelos Kranakis
%A Lambert Meertens
%P 181-185
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Definite Tree Languages (cont'd)
%A Maurice Nivat
%A Andreas Podelski
%P 186-190
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Semi-Commutation for Place/Transition Systems
%A Edward Ochma\'nski
%P 191-198
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Knowledge, Reasoning and Classification - A Rough Set Perspective
%A Zdzis{\l}aw Pawlak
%P 199-210
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Improving TABLOG
%A H. C. M. de Swart
%P 211-218
%J |BEATCS|
%D june 1989
%V 38
%Z Technical Contributions

%T Making Formality Work for Us
%A Roland Backhouse
%P 219-249
%J |BEATCS|
%D june 1989
%V 38
%Z Surveys and Tutorials

%Z Columns: Computational Geometry
%A Herbert Edelsbrunner
%T ( Impact of Computational Geometry in the Classroom )
%P 109-116
%J |BEATCS|
%D february 1989
%V 37

%Z Columns: Structural Complexity
%A Juris Hartmanis
%T On the Importance of Being $\Pi_2$-Hard
%P 117-127
%J |BEATCS|
%D february 1989
%V 37
%%U http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cornell/TR89-961
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column37.ps

%T Langford Strings are Squarefree
%A Jean Berstel
%P 127-129
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T A Remark on a Note by M.A.~Bednarczyk
%A Wilfried Brauer
%P 129
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T Minimization by Reversal is not New
%A J. A. Brzozowski
%P 130
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T Recursive VLSI Design and Application
%A Lothar Budach
%A Ernst-G\"unther Giessmann
%A Hubert Grassmann
%A Bernd Graw
%A Christoph Meinel
%A Burkhard Molzan
%A Uwe Sch\"afer
%A Pieter Zienicke
%P 131-150
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T More on Minimal Finite Automata
%A Ernst L. Leiss
%P 151-152
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T Note on (E0L-E0L) Array Systems
%A Nalinakshi Nirmal
%A R. Rama
%P 152-160
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T Sets without Empty Convex 6-Gons
%A Mark Overmars
%A Bertha Scholten
%A Ingrid Vincent
%P 160-168
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T Can Inductive Proofs be Automated? Part II
%A Peter Padawitz
%P 168-174
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T A Look at Concurrency Semantics Through 'Lattice Glasses'
%A Leonid Rosenblum
%A Alexandre Yakovlev
%A Vladimit Yakovlev
%P 175-180
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T Formula-Handling Computer Solution of Boolean Equations. I. Ring Equations
%A Viorica Sofronie
%P 182-186
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%T Nondeterminism, Fairness and a Fundamental Analogy
%A Edith Spaan
%A Leen Torenvliet
%A Peter van Emde~Boas
%P 186-193
%J |BEATCS|
%D february 1989
%V 37
%Z Technical Contributions

%Z Surveys and Tutorials
%T Corrections and Additions to:
   Some Applications of Logic of Universal Algebra, and of Category Theory
   to the Theory of Graph Transformations
%A Bruno Courcelle
%P 194-195
%J |BEATCS|
%D february 1989
%V 37

%T How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students
%A Ian Parberry
%Z reprinted from SIGACT News, Vol.~19, No.~2, pp.~42-47, 1988
%P 344-349
%J |BEATCS|
%D february 1989
%V 37

%Z Columns: Algebraic Specification
%A Hartmut Ehrig
%T Questionnaire for Information about Applications of Algebraic Specifications
%P 52-56
%J |BEATCS|
%D october 1988
%V 36

%Z Columns: Logic in Computer Science
%A Andreas Blass
%T Topoi and Computation
%P 57-65
%J |BEATCS|
%D october 1988
%V 36

%Z Columns: Structural Complexity
%T Self-Reducibility: teh Effects of Structure on Complexity
%A Deborah Joseph
%A Paul Young
%P 66-84
%J |BEATCS|
%D october 1988
%V 36

%Z Columns: Formal Language Theory
%A Arto Salomaa
%T Cryptographic Transductions
%P 85-95
%J |BEATCS|
%D october 1988
%V 36

%Z Surveys and Tutorials
%T Some Applications of Logic of Universal Algebra, and of Category Theory
   to the Theory of Graph Transformations
%A Bruno Courcelle
%P 161-218
%J |BEATCS|
%D october 1988
%V 36

%A Peter R. J. Asveld
%T On a Post's System of Tag
%P 96-102
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A Helmut Alt
%A Hubert Wagener
%T Approximation of Polygons by Rectangles and Circles
%P 103-113
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A Marek A. Bednarczyk
%T On Minimal Finite Automata
%P 113-115
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A H. L. Bodlaender
%T Some Classes of Graphs with Bounded Treewidth
%P 116-126
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A Juraj Hromkovi\v{c}
%T A Candidate for Nonlinear Lower Bound on the Combinatonal Complexity
%P 126-128
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A Clemens Lautemann
%T A Note on Polynomial Interpretation
%P 129-131
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A M. Nivat
%A A Saoudi
%T Automata on Infinite Trees and Kleene Closure of Regular Tree Sets
%P 131-136
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A Patrice Seebold
%T An Effective Solution to the D0L Periodicity Problem in the Binary Case
%P 137-151
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A Mikko Tiusanen
%T Some Unsolved Problems in Modelling Self-Timed Circuits using Petri-Nets
%P 152-160
%Z Technical Contributions
%J |BEATCS|
%D october 1988
%V 36

%A Herbert Edelsbrunner
%T ( On 4th Annual ACM Symposium on Computational Geometry )
%Z Columns: Computational Geometry
%P 66-68
%J |BEATCS|
%D june 1988
%V 35

%A Hartmut Ehrig
%T On the Potential Role of Algebraic Specification within Computer Science
%Z Columns: Algebraic Specification
%P 69-71
%J |BEATCS|
%D june 1988
%V 35

%A Yuri Gurevich
%Z Columns: Logic in Computer Science
%P 71-82
%T Kolmogorov Machines and related issues
%J |BEATCS|
%D june 1988
%V 35
%U http://research.microsoft.com/\~gurevich/Opera/78.ps

%A Juris Hartmanis
%A R. Chang
%A J. Kadin
%A S. Mitchell
%Z Columns: Structural Complexity
%T Some Observations about Relativization of Space Bounded Computations
%P 82-92
%J |BEATCS|
%D june 1988
%V 35
%%U http://www.csee.umbc.edu/\~chang/papers/log/
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column35.ps

%A Arto Salomaa
%Z Columns: Formal language Theory
%T Cryptography and Natural Languages
%P 92-96
%J |BEATCS|
%D june 1988
%V 35

%A Stefano Baratella
%A Gilberto Fil\`e
%T A Completeness Result for SLDNF Resolution
%P 97-105
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A A. Bertoni
%A N. Sabadini
%T Generating Functions of Trace Languages
%P 106-112
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A W. Brauer
%T On Minimizing Finite Automata
%P 113-116
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Manfred Broy
%A Martin Wirsing
%T Ultra-loose Algebraic Specification
%P 117-128
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Ir\`ene Guessarian
%T Fixpoint Strategies for Deductive Datebases
%P 128-136
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Uschi Heuter
%T Definite Tree Languages
%P 137-142
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Thomas Lengauer
%A Egon Wanke
%T Efficient Processing of Hierarchical Graphs for Engineering Design
%P 143-157
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Antonio Lozano
%T NP-Hardness on Succinct Representations of Graphs
%P 158-163
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Peter Padawitz
%T Can Inductive Proofs be Automated
%P 163-170
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Lutz Priese
%T Fairness
%P 171-180
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Wolfgang Reisig
%T Concurrency is More Fundamental Than Interleaving
%P 181-185
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A H.C.M. de Swart
%A W.M.J. Ophelders
%T Another Tableau Based Automateed Theorem Prover for Classical Logic
%P 185-197
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%A Ingo Wegener
%T Prime Implicants and parallel Complexity
%P 198-204
%J |BEATCS|
%D june 1988
%V 35
%Z Technical Contributions

%Z Surveys and Tutorials
%T Do-it-yourself Type Theory (Part 2)
%A Roland Backhouse
%A Paul Chisholm
%A Grant Malcolm
%P 205-245
%J |BEATCS|
%D june 1988
%V 35

%A Herbert Edelsbrunner
%T ( The log-function in complexity )
%Z Columns: Computational Geometry
%J |BEATCS|
%D february 1988
%V 34
%P 32-39

%Z Columns: Algebraic Specification
%A Hartmut Ehrig
%T The Algebraic Specification Column, 3
%P 39-40
%J |BEATCS|
%D february 1988
%V 34

%Z Columns: Formal Language Theory
%A J. Karhum\"aki
%T The Impact of the D0L Problem
%J |BEATCS|
%D february 1988
%V 34
%P 41-46

%T Critical Factorizations of Words
%A Maxime Crochemore
%A Dominique Perrin
%J |BEATCS|
%D february 1988
%V 34
%Z Technical Contributions
%P 47-52

%T On the Infinite Completion of Codes
%A Clelia De~Felice
%J |BEATCS|
%D february 1988
%V 34
%Z Technical Contributions
%P 52-54

%T Note. On the Domain of Tree Transducers
%A Z. F\"ul\"op
%A S. V\'agv\"olgyi
%P 55-61
%J |BEATCS|
%D february 1988
%V 34
%Z Technical Contributions

%T Formal Languages before Axel Thue ?
%A Solomon Marcus
%J |BEATCS|
%D february 1988
%V 34
%Z Technical Contributions
%P 62

%T On Langford-Lyndon-Thue Sequences
%A Gheorghe P\v{a}un
%P 63-67
%J |BEATCS|
%D february 1988
%V 34
%Z Technical Contributions

%Z Surveys and Tutorials
%T Do-it-yourself Type Theory (Part 1)
%A Roland Backhouse
%A Paul Chisholm
%A Grant Malcolm
%P 68-110
%J |BEATCS|
%D february 1988
%V 34

%Z Problems and Solutions
%T Two Problems in Unification Theory
%A Manfred Schmidt-Schau{\ss}
%P 273
%J |BEATCS|
%D february 1988
%V 34

%T Solution to Problem P140 and P141 (Unification Theory)
%A Manfred Schmidt-Schau{\ss}
%P 274-275
%J |BEATCS|
%D februari 1988
%V 34
%Z Problems and Solutions

%Z Problems and Solutions
%T Solutions of three Problems about Morphisms generating Infinite Words
%A Patrice S\'e\'ebold
%P 275-284
%J |BEATCS|
%D februari 1988
%V 34

%T ( Workshop on Specification of Abstract Data Types )
%A Hartmut Ehrig
%P 25-26
%Z Columns: Algebraic Specification
%J |BEATCS|
%V 33
%D October 1987

%T The Collapsing Hierarchies
%A Juris Hartmanis
%P 26-39
%Z Columns: Structural Complexity
%J |BEATCS|
%V 33
%D October 1987
%%U http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cornell/TR87-861
%U http://people.cs.uchicago.edu/\~fortnow/beatcs/column33.ps

%T ( Conferences, Journals, Books )
%A Herbert Edelsbrunner
%P 23-24
%Z Columns: Computational Geometry
%J |BEATCS|
%V 33
%D October 1987

%T ( Object Oriented Systems )
%A Jan Paredaens
%P 40-41
%Z Columns: Database Theory
%J |BEATCS|
%V 33
%D October 1987

%T Playfair
%A Arto Salomaa
%P 42-53
%Z Columns: Formal Languages
%J |BEATCS|
%V 33
%D October 1987

%T Concurrency and Interleaving are Equally Fundamental
%A David B. Benson
%P 54-55
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T Compatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages
%A Annegret Habel
%A Hans-J\"org Kreowski
%A Walter Vogler
%P 55-62
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T Unambiguous Automata
%A Werner Kuich
%P 62-67
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T A Further Link between Formal Languages and Complexity Theory
%A Klaus-J\"orn Lange
%A Michael Schudy
%P 67-71
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T Process Modalities Obtained as Fixed Points (part two)
%A J.-J. Ch. Meyer
%P 71-82
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T A Non-Invertible PCP Language
%A Edward Ochma\'nski
%P 83-84
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T Decision Tables - A Rough Set Approach
%A Zdzislaw Pawlak
%P 85-95
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T The Method of Forcing for Nondeterministic Automata
%A R\'obert Szelepcs\'enyi
%P 96-100
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T A Non-Deterministic Algorithm and its Analysis
%A Gerard Tel
%A Jan van Leeuwen
%P 100-103
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T An Overview of Miranda
%A David Turner
%P 103-114
%Z Technical Contributions
%J |BEATCS|
%V 33
%D October 1987

%T A Powerdomain Primer
%A Michael G. Main
%P 115-147
%Z Surveys and Tutorials
%J |BEATCS|
%V 33
%D October 1987

%T Sufficient-Completeness, Quasi-reducibility, and their Complexity
%A Deepak Kapur
%A Paliath Narendram
%P 279-281
%Z Problems and Solutions
%J |BEATCS|
%V 33
%D October 1987

%T ( Scheme for Algebraic Specification Topics )
%A Hartmut Ehrig
%P 70-72
%Z Columns: Algebraic Specification
%J |BEATCS|
%D June 1987
%V 32

%T Sparse Complete Sets for NP and the Optimal Collapse of the
%T Polynomial Hierarchy
%A J. Hartmanis
%P 73-81
%Z Columns: Structural Complexity
%J |BEATCS|
%D June 1987
%V 32

%T Two-Way Thue
%A Arto Salomaa
%P 82-86
%Z Columns: Formal Languages
%J |BEATCS|
%D June 1987
%V 32

%T Knuth-Bendix procedure and non deterministic behavior -- An example
%A I. Gnaedig
%P 86-92
%Z Technical Contributions
%J |BEATCS|
%D June 1987
%V 32

%T Detecting leftmost Periodicities
%A Michael G. Main
%P 93-97
%Z Technical Contributions
%J |BEATCS|
%D June 1987
%V 32

%T Process Modalities Obtained as Fixed Points (part one)
%A J.-J. Ch. Meyer
%P 98-107
%Z Technical Contributions
%J |BEATCS|
%D June 1987
%V 32

%T Pomset Semantics is Consistent with Data flow Semantics
%A Alexander Rabinovich
%P 107-117
%Z Technical Contributions
%J |BEATCS|
%D June 1987
%V 32

%T Geometrics and Algorithmics --
%T A Tutorial in Computational Geometry
%A Herbert Edelsbrunner
%P 118-142
%Z Surveys and Tutorials
%J |BEATCS|
%D June 1987
%V 32

%T Term Rewriting Systems: A Tutorial
%A Jan Willem Klop
%P 143-182
%Z Surveys and Tutorials
%J |BEATCS|
%D June 1987
%V 32

%T Note: On the sufficiency of Igarashi's conditions for real-time
%T deterministic context-free languages
%A R. Boonyavatana
%A G. Slutzki
%Z Technical Contributions
%P 9-11
%J |BEATCS|
%D Februari 1987
%V 31

%T Concurrency vs Interleaving: an instructive example
%A Luca Castellano
%A Georgio De~Michelis
%A Lucia Pomello
%P 12-15
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%T A note on the polynomial-time hierarchy and the quantified boolean formulas
%A Bogdan S. Chlebus
%P 15-22
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%T A note on termination in combinations of heterogeneous term rewriting systems
%A Harald Ganzinger
%A Robert Giegerich
%P 22-28
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%T On the construction of unifying terms modulo a set of substitutions
%A Steffen Lange
%P 29-35
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%T Normal forms for pure context-free grammars
%A Erkki M\"akinen
%P 35-38
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%T A remark on variations of power domains
%A Axel Poign\'e
%P 38-42
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%T How not to sweep infixes under the carpet
%A Stefan Sokolowski
%P 42-47
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%T Efficient leader finding in arbitrary networks
%A Gerard Tel
%P 47-49
%Z Technical Contributions
%J |BEATCS|
%D Februari 1987
%V 31

%Z Bibliographies
%T Partial evaluation bibliography
%P 50-54
%A P. Sestoft
%J |BEATCS|
%D Februari 1987
%V 31

%Z Surveys and Tutorials
%A Hans-J\"org Kreowski
%T Some initial sections of the algebraic-specification tale
%P 55-78
%J |BEATCS|
%D Februari 1987
%V 31

%Z Surveys and Tutorials
%A I. Hal Sudborough
%T 'Cutwidth' and related graph problems
%P 79-110
%J |BEATCS|
%D Februari 1987
%V 31

%A Herbert Edelsbrunner
%Z Columns: Computational Geometry
%T Computational Geometry Column (no. 1)
%P 111-114
%J |BEATCS|
%D Februari 1987
%V 31

%Z Columns: Structural Complexity
%A J. Hartmanis
%T A retrospective on structural complexity
%P 115-122
%J |BEATCS|
%D Februari 1987
%V 31
%U http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cornell/TR87-839

%Z Columns: Theory of Databases
%A J. Paredaens
%T On database models - summary of a panel discussion
%P 123-124
%J |BEATCS|
%D Februari 1987
%V 31

%Z Problems and Solutions
%A Jean-Pierre Jouannaud
%T A set of 11 important open problems in Term Rewriting based Theorem Proving
%P 272-273
%J |BEATCS|
%D Februari 1987
%V 31

%A A. Salomaa
%T Scattered recollections about EATCS
%J |BEATCS|
%D October 1986
%V 30
%P 3-6

%A G. Hansel
%T Symbolic dynamics, automata and coding theory
%J |BEATCS|
%D October 1986
%V 30
%P 15-23

%A A. Sch\"onhage
%T Tapes versus pointers, a study in implementing fast algorithms
%J |BEATCS|
%D October 1986
%V 30
%P 23-32

%A J.L. Balc\'azar
%A J. gabarro
%T Some comments about notations of orders of magnitude
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 34-42

%A R.M. Capocelli
%T Comments on 'Trends in the Theory of Codes' by J.~Berstel and D.~Perrin
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 43-44

%A A. Choquet
%A A. Finkel
%Z Technical Contributions
%T Applications of residues for the analysis of parallel systems communicating by
%T fifo channels
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 44-57

%A M. Crochemore
%T Computing LCF in linear time
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 57-61

%A H. Ehrig
%A J. Loeckx
%A B. Mahr
%T A remark on the equational calculus for many-sorted algebras with possibly
%T empty carrier sets
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 61-66

%A J.A. Goguen
%A J. Meseguer
%T Remarks on remarks on many-sorted equational logic
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 66-73

%A A.J. Kfoury
%T A linear time algorithm to decide whether a binary word contains an overlap
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 74-80

%A P. Lescanne
%T Divergence of the Knuth-Bendix completion procedure and termination orderings
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 80-83

%A A. De~Luca
%A A. restivo
%T On a generalization of a conjecture of Ehrenfeucht
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 84-90

%A N. Nirmal
%A R. Rama
%A C. Sri~Hari~Nagore
%T Closure properties of E0L-regular matrix lamguages
%Z Technical Contributions
%J |BEATCS|
%D October 1986
%V 30
%P 102

%Z Miscellaneous
%A F. G\'ecseg
%T The role of theory in computer science
%J |BEATCS|
%D October 1986
%V 30
%P 295-298

%Z Problems and Solutions
%T Rational equivalence relations
%A J. Howard Johnson
%P 260-261
%J |BEATCS|
%D October 1986
%V 30

%Z Problems and Solutions
%A M. Crochemore
%T Powerfree morphisms
%P 261-262
%J |BEATCS|
%D October 1986
%V 30

%T Guidelines for the formation and functioning of ICALP program committees
%A {EATCS Council}
%P 3-8
%Z EATCS Matters
%J |BEATCS|
%D June 1986
%V 29

%A C. Calude
%T Note on Ehrenfeucht's conjecture and Hilbert's basis theorem
%P 18-22
%J |BEATCS|
%D June 1986
%V 29
%Z Technical Contributions

%A H. Ehrig
%A A. Habel
%A U. Hummert
%A P. boehm
%T Towards algebraic data types grammars:
%T a junction between algebraic specification and graph grammars
%P 22-27
%J |BEATCS|
%D June 1986
%V 29
%Z Technical Contributions

%A M. Gheorge
%A Gh. Paun
%T Two (infinite?) hierarchies of vector languages
%P 27-31
%J |BEATCS|
%D June 1986
%V 29
%Z Technical Contributions

%A I. Guessarian
%T Fixpoint techniques in data base recursive logic prorams
%P 32-35
%J |BEATCS|
%D June 1986
%V 29
%Z Technical Contributions

%A A. Hemmerling
%T Real-time recognition of some languages by tellis and cellular automata and
%T full scan Turing machines
%P 35-39
%J |BEATCS|
%D June 1986
%V 29
%Z Technical Contributions

%A E. Kinber
%A A. Salomaa
%A S. Yu
%T On the equivalence of grammars inferred from derivation
%P 39-46
%J |BEATCS|
%D June 1986
%V 29
%Z Technical Contributions

%A M. Wirsing
%T Algebraic specification of the abstract data type 'Continuum' without hidden operations
%P 46-55
%J |BEATCS|
%D June 1986
%V 29
%Z Technical Contributions

%Z Bibliographies
%A P. Chatelin
%T A bibliography on matrix multiplication complexity and related problems 
%T (July 1968- January 1986)
%P 55-69
%J |BEATCS|
%D June 1986
%V 29

%Z Surveys and Tutorials
%A P. America
%T Object-oriented programming: a theoretician's introduction
%P 69-84
%J |BEATCS|
%D June 1986
%V 29

%Z Surveys and Tutorials
%A J. Berstel
%A D. Perrin
%T Trends in the theory of codes
%P 84-95
%J |BEATCS|
%D June 1986
%V 29

%Z Surveys and Tutorials
%A E.R. Olderog
%T Semantics of concurrent processes:
%T the search for structure and abstraction, Part II
%P 96-117
%J |BEATCS|
%D June 1986
%V 29

%Z Technical Contributions
%A V. Akman
%A W.R. Franklin
%T On the question 'Is $\sum_1^n\sqrt{a_i} \le L$'
%P 16-20
%V 28
%D February 1986
%J |BEATCS|

%A R. Boonyavatana
%A G. Slutzki
%T A generalized Ogden's lemma for linear context-free languages
%P 20-26
%Z Technical Contributions
%V 28
%D February 1986
%J |BEATCS|

%A E. Fachini 
%A L. Iania
%T A note on the paper 'Systolic tree acceptoors'
   by K. Culik~II, A. Salomaa and D. Wood
%P 26-30
%Z Technical Contributions
%V 28
%D February 1986
%J |BEATCS|

%A S. Horv\'ath
%T Finite, simple generating sytems for partial recursive functions
%P 30-32
%Z Technical Contributions
%V 28
%D February 1986
%J |BEATCS|

%A S. Kaplan
%A M. Choquer
%T On the decidability of quasi-reducibility
%P 32-34
%Z Technical Contributions
%V 28
%D February 1986
%J |BEATCS|

%A J. Lawrence
%T The non-existence of finite test sets for set-equivalence of finite substitutions
%P 34-37
%Z Technical Contributions
%V 28
%D February 1986
%J |BEATCS|

%A R. Siromoney
%A G. Siromoney
%T A public key cryptosystem that defies cryptoanalysis
%P 37-43
%Z Technical Contributions
%V 28
%D February 1986
%J |BEATCS|

%A B. Thalheim
%T A response to the note by M.Y.~Vardi
%P 44-45
%Z Technical Contributions
%V 28
%D February 1986
%J |BEATCS|

%A F. Nielson
%T A bibliography on abstract interpretation
%P 45-52
%Z Bibliographies
%V 28
%D February 1986
%J |BEATCS|

%Z Surveys and tutorials
%A M. Jantzen
%T Confluent string rewriting and congruences
%P 52-72
%V 28
%D February 1986
%J |BEATCS|

%A E.-R. Olderog
%T Semantics of concurrent processes: the search for structure and abstraction
   Part I
%Z Surveys and tutorials
%P 73-97
%V 28
%D February 1986
%J |BEATCS|

%A A. Kelemenov\'a
%A J. Kelemen
%T Questions to Prof. A.~Salomaa
   (an interview for 'the journal of the society of Czechoslovak Mathematicians and Physicists')
%P 230-236
%Z Miscellaneous
%V 28
%D February 1986
%J |BEATCS|

%A D. Knuth
%T Theory and Practice
%P 14-
%J |BEATCS|
%V 27
%D October 1985
%Z ICALP'86

%A M.P. Chytil
%A M. Pl\'atek
%A J. Vogel
%T A note on the Chomsky hierarchy
%P 23-30
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A K. Culik~II
%A J. Karhum\"aki
%T Decision problems solved with the help of the Ehrenfeucht conjecture
%P 30-35
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A R. Freivalds
%T Recursiveness of the enumerating functions increases the inferrability of
   recursively enumerable sets
%P 35-40
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A J. Hartmanis
%T Solvable problems with conflicting relativizations
%P 40-49
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A J.-P. Jouannaud
%A E. Kounalis
%T Proofs by induction in equational theories without constructors
%P 49-55
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A E. Ochma\'nski
%T Regular behaviour of concurrent systems
%P 56-67
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A D. Perrin
%T On the solution of Ehrenfeucht's conjecture
%P 68-70
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A A. Salomaa
%T The Ehrenfeucht conjecture: a proof for language theorists
%P 71-82
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A J.-P. Jouannaud
%T ( Proofs in equational theories, Open problems )
%Z Problems and Solutions
%P 244-245
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A S. Marcus
%T Problems
%P 245
%Z Problems and Solutions
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%A E. Dahlhaus
%A H. Gaifman
%T Concerning 2-adjacent contextfree languages
%P 246-248
%Z Problems and Solutions
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%T Open Problem: Searching k sorted lists
%A M.G. Main
%A J. Shultis
%P 246
%Z Problems and Solutions
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%T A partial answer to problem P97 Of J.~Karhum\"aki
%A Y. Maon
%P 248-250
%Z Problems and Solutions
%J |BEATCS|
%V 27
%D October 1985
%Z Technical Contributions

%T Witold Lipski (1949-1985)
%A Krzystof R. Apt
%A Tomasz Imielinski
%P 258
%Z Obituaries
%J |BEATCS|
%V 27
%D October 1985

%T Witold Lipski (1949-1985)
%A A. Blikle
%P 258-259
%Z Obituaries
%J |BEATCS|
%V 27
%D October 1985

%T Theory and practice in software engineering
%A Maurice Nivat
%P 260-261
%Z Miscellaneous
%J |BEATCS|
%V 27
%D October 1985

%% BEATCS volume 26
%A Leo Guibas
%A John Hershberger
%T Computing the visibility graph of n line segments in O(n^2) time
%P 13-20
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Christos H. Papadimitriou
%T A note on the expressive power of Prolog
%P 21-23
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Athansios K. Tsakalidis
%T The nearest common ancestor in a dynamic tree
%P 23-31
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Manfred Broy
%A Andrzej Tarlecki
%T Algebraic specification of the abstract data type 'continuum'
%P 32-35
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Joost Engelfriet
%T The non-computability of computability
%P 36-39
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A W. Erni
%A R. Geibel
%T Recognition of E0L by polynomial Boolean circuits
%P 40-43
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Haim Gaifman
%A Moshi Y. Vardi
%T A simple proof that connectivity of finite graphs is not first-order definable
%P 43-45
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Marian Gheorge
%T Descriptional complexity measures suggested by Hartmann's recovery scheme
%P 45-54
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Klaus-J\"orn Lange
%T Addendum to 'A note on the closure of E0L languages under erasing homomorphisms'
%P 55
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Jean-Jacques Pansiot
%T Subword complexities and iteration
%P 55-62
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A K.G. Subramanian
%T Regular control on NLC grammars
%P 63-65
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Moshe Y. Vardi
%T A response to 'A complete axiomatisation for full join dependencies in relations'
%P 65-67
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%A Jozef Vyskoc
%T Pigeon-hole principle and Boolean matrix multiplication
%P 67-68
%Z Technical Contributions
%J |BEATCS|
%V 26
%D June 1985

%Z Surveys and Tutorials
%T Challenges and opportunities in VLSI theory
%A Arnold L. Rosenberg
%P 69-100
%J |BEATCS|
%V 26
%D June 1985

%Z Surveys and Tutorials
%T Cryptography from Caesar to DES and RSA
%A Arto Salomaa
%P 101-120
%J |BEATCS|
%V 26
%D June 1985

%Z Problems and Solutions
%A Herbert Edelsbrunner
%T Problems in computational and combinatorial geometry
   (P103 -- P110)
%P 239
%J |BEATCS|
%V 26
%D June 1985

%Z Problems and Solutions
%A Jetty Kleijn
%A Grzegorz Rozenberg
%T Problems ( on pattern grammars, P111-- P113)
%P 240-241
%J |BEATCS|
%V 26
%D June 1985

%Z Problems and Solutions
%P 241
%T Problems (on cellular automata and regular languages, P114 )
%A Stephen Wolfram
%J |BEATCS|
%V 26
%D June 1985

%Z Problems and Solutions
%A Jacob E. Goodman
%A Richard Pollack
%T On problem P74 - 'How many planar configurations are there?'
%P 242
%J |BEATCS|
%V 26
%D June 1985

%Z Problems and Solutions
%A Eric Allender
%T Solutions for problems P90 and P91
%P 243-244
%J |BEATCS|
%V 26
%D June 1985

%Z Problems and Solutions
%T A solution to Paun's problem P100
%A M. Clerbout
%P 244-246
%J |BEATCS|
%V 26
%D June 1985

%% BEATCS volume 25
%A S. Arnborg
%A A. Proskurowski
%T Problems on graphs with bounded decomposability
%P 7-11
%Z Technical Contributions
%V 25
%D February 1985
%J |BEATCS|
%V 25

%A J.L. Balc\'azar
%A J. D\'{\i}az
%A J. Gabarr\'o
%T Examples of CFI-BI-immune and CF-levelable sets in logspace
%P 11-14
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A S. Buzeteanu
%T Some generalizations of Kleene's second fixed-point theorem
%P 14-19
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A J. Gabarr\'o
%T Some applications of the interchange lemma
%T 19-21
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A K.-J. Lange
%T A note on the closure of E0L-languages under erasing homomorphisms
%P 22-24
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A T. Ottmann
%A M. Schrapp
%A D. Wood
%T Weight-balanced trees are not stratisfied
%P 24-31
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A M.H. Overmars
%A E. Welzl
%T A simple method for solving 2-dimensional static range searching
%P 31-33
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A G. Paun
%T On Parikh-boundedness of matrix languages
%P 34-37
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A P.M.B. Vitanyi
%T Logarithmic signal propagation delay and the efficiency of VLSI circuits
%P 37-40
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A P. Turakainen
%T A note on test sets for R-rational languages
%P 40-42
%Z Technical Contributions
%D February 1985
%J |BEATCS|
%V 25

%A A.L. Rosenberg
%T References to the literature on VLSI algorithms and related mathematical and practical
   issues
%P 42-63
%Z Bibliographies
%D February 1985
%J |BEATCS|
%V 25

%A H.-J. Kreowski
%T Parallelism and concurrency in graph grammars (incomplete sketch)
%P 63-79
%Z Surveys and Tutorials
%D February 1985
%J |BEATCS|
%V 25

%T Obituary of J.R.~B\"uchi, 1924-1984
%A Dirk Siefkes
%A Paul Young
%A Leonard Lipshitz
%P 197-198
%D February 1985
%J |BEATCS|
%V 25

%A David S. Johnson
%T The genealogy of theoretical computer science
   -- A preliminary report
%X Reprinted from Sigact News 16:2 (Summer 1984), 36-49
%Z Miscellaneous
%P 198-211
%D February 1985
%J |BEATCS|
%V 25

%A J.M. Autebert
%A L. Boasson
%A J. Gabarr\'o
%T Context-free grammars in Greibach normal forms
%P 44-47
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A T. Balanescu
%T A proof rule for the 'it ti' generalized control structure
%P 48-53
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A S.L. Bloom
%A Z. Esik
%T Some vrieties of iteration theories
%P 53-66
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A M. Crochemore
%T Linear searching for a square in a word
%P 66-72
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A J. Hartmanis
%T On non-isomorphic NP complete sets
%P 73-78
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984
%U http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cornell/TR83-576

%T A searching algorithm for finite embedded D-graphs with no more than k regions
%A A. Hemmerling
%P 78-84
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A C. \'O'D\'unlaing
%A C.K. Yap
%T Counting digraphs and hypergraphs
%P 85-88
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A P. Padawitz
%A M. Wirsing
%T Completeness of many-sorted equational logic revisited
%P 88-94
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A Z. Pawlak
%T On rough sets
%P 94-109
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A B. Thalheim
%T A complete axiomatization for full join dependencies in relations
%P 109-115
%Z Technical Contributions
%J |BEATCS|
%V 24
%D October 1984

%A Wolfgang Thomas
%T On problem P63 of M.~Takahashi:
%T \omega-languages which are first-order definable in terms of prefixes
%P 213-216
%Z Problems and Solutions
%J |BEATCS|
%V 24
%D October 1984

%A Tero Harju
%T On factorizations of words
%P 217
%X This example shows in the negative the problem P66 of J. Karhum\"aki
   Bulletin EATCS 23, 1984.
%Z Problems and Solutions
%J |BEATCS|
%V 24
%D October 1984

%A Tero Harju
%T P67: A solution to a problem of Karhum\"aki
%P 218-220
%Z Problems and Solutions
%J |BEATCS|
%V 24
%D October 1984

%A J.R. Kennaway
%T Solution of Bull.EATCS Problem 68
%P 220-221
%Z Problems and Solutions
%J |BEATCS|
%V 24
%D October 1984

%A K.D. Kaufmann
%A H. M\"uller
%T Calculating the orientation of simple polygons
   (Problem P69 of G.~Knott)
%P 222
%Z Problems and Solutions
%J |BEATCS|
%V 24
%D October 1984

%T Obituary of J.R.~B\"uchi
%A Dirk Siefkes
%P 234
%J |BEATCS|
%V 24
%D October 1984

%A C. Calude
%A I. Chitescu
%T A class of universal P.~Martin-L\"of tests
%V 23
%P 15-22
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A R.P. Daley
%A C.H. Smith
%T On the complexity of inductive inference
%V 23
%P 22-28
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A A. Finkel
%T Petri nets and homogenous FIFO nets
%V 23
%P 28-31
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A R. freivalds
%T An answer to an open problem
%V 23
%P 31-32
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A J. Hromkovi\v{c}
%T On the power of Yao-Rivest technique
%V 23
%P 33-35
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A I. Korec
%T Two kinds of processors are sufficient and large operating alphabets are
   needed for regular trellis automata languages
%V 23
%P 35-42
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A K. Lautenbach
%A A. Pagnoni
%T On the various high-level Petri-Nets and their invariants
%V 23
%P 42-58
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A A.K. Lenstra
%T Polynomial-time algorithms for the factorization of polynomials
%V 23
%P 59-76
%Z Technical Contributions
%J |BEATCS|
%D June 1984

%A A. Kelemenov\'a
%A J. Kelemen
%T Interview with A. Lindenmayer
   (for 'the journal of the society of Czechoslovak Mathematicians and Physicists')
%P 185-198
%Z Miscellaneous
%V 23
%J |BEATCS|
%D June 1984

%A E.B. Kinber
%T On the problem P9(2) of J.~Case
%V 23
%P 178-183
%Z Problems and Solutions
%J |BEATCS|
%D June 1984

%T Remarks on Defining the Complement of a Language
%A Peter R. J. Asveld
%P 5-7
%J |BEATCS|
%V 22
%D february 1984
%Z Technical Contributions

%T Some Results about Logspace Complexity Measures
%A J. L. Balcazar
%A J. D\'iaz
%A K. Gabarr\'o
%P 8
%J |BEATCS|
%V 22
%D february 1984
%Z Technical Contributions

%T Computing The Connected Components of D-Ranges
%A Bernard Chazelle
%A Janet Incerpi
%P 9-11
%J |BEATCS|
%V 22
%D february 1984
%Z Technical Contributions

%T A Note on DT0L Systems
%A J\"urgen Dassow
%P 11-14
%J |BEATCS|
%V 22
%D february 1984
%Z Technical Contributions

%T Big Omega versus the Wild Functions
%A Paul M. B. Vit\'anyi
%A Lambert Meertens
%P 14-19
%J |BEATCS|
%V 22
%D february 1984
%Z Technical Contributions

%T A Note on the 'Communication Complexity' Paper by Papadimitriou and Sipser
%A Juraj Hromkovi\v{c}
%P 20
%J |BEATCS|
%V 22
%D february 1984
%Z Technical Contributions

%T A Negative Result for B\"uchi's Automata
%A A. Arnold
%P 11
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%A A. Blumer
%A J. Blumer
%A A. Ehrenfeucht
%A D. Haussler
%A R. MaConnell
%T Linear Size Finite Automata for the Set of all Subwords of a Word. 
   An Outline of Results
%P 12-20
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T A Note on \omega -regular languages
%A Y. Choueka
%A D. Peleg
%P 21-23
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T Notes on the Equivalence of Some Programs
%A Nadejda Georgieva
%P 24-30
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T Algebraic Specification with Subsorts using Declarations
%A M. Gogolla
%A H. D. Ehrich
%P 31-38
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T On Graph Rewritings
%A Jean-Claude Raoult
%P 39-49
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T On Weakly Square Free Words
%A Antonio Restivo
%A Sergio Salemi
%P 49-56
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T An Alternative Definition of NP
%A Diana Schmidt
%P 57-67
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T Monogenous Fifo-Nets and Petri-Nets are Equivalent
%A Peter H. Starke
%P 68-77
%J |BEATCS|
%V 21
%D october 1983
%Z Technical Contributions

%T Disk Allocation for Cartesian Product Files, a Couterexample
%A Jan Bergstra
%P 31-35
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A H. Bunke
%P 35-39
%T What is the Distance between Graphs?
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Cristian calude
%T A Simple Non-Uniform Operation
%P 40-46
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A B. Courcelle
%T Recognizing Regular Languages with Rewriting
%P 47-48
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A R. Freivalds
%A E. B. Kinber
%T On Extension of Inferrable Classes
%P 49-53
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Harold M. Gabow
%T Priming the Pump for Lower Bounds on Chomsky Form
%P 54-67
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Juha Honkala
%A Arto Saloma
%T How Do You Define the Complement of a Language
%P 68-69
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A S. Istrael
%T A Programming Exercise with Some Theoretical Appeal: The Piling of Counters I.
%P 70-85
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A S. Istrael
%T A Programming Exercise with Some Theoretical Appeal: The Piling of Counters II.
%P 85-97
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Wolfgang H. Janko
%T Addendum to A Bibliography on Randomized Algorithms
%P 98-103
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A P. E. Lauer
%T A  Bibliography of a Project on Formal Models of Concurrency
%P 103-107
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A G. Longo
%A S. Martini
%T Computability in Higher Types and the Universal Domain P\omega
%P 107-114
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A M. Nagl
%T Bibliography on Graph Rewriting Systems (Graph-Grammars)
%P 114-148
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Francesco Parisi-Presicce
%T A Remark on Iterative Congruences
%P 148-152
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Joseph Sifakis
%T A Note on Deadlocks in CA-Systems
%P 153-159
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Rani Siromoney
%A K. G. Subramanian
%T Generative Grammar for the Cube-Free Abbey Floor
%P 160-162
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Paavo Turakainen
%T A Machine-Oriented Approach to Compositions of Morphisms and Inverse Morphisms
%P 162-166
%J |BEATCS|
%V 20
%D june 1983
%Z Technical Contributions

%A Arturo Carpi
%T A Solution to Berstel's Problem No P1
%J |BEATCS|
%V 19
%D februari 1983
%P 2-4
%Z Technical Contributions

%A Clelia De~Felice
%T An Answer to Berstel's Problem N. P2
%J |BEATCS|
%V 19
%D februari 1983
%P 5-7
%Z Technical Contributions

%A John Case
%A Mark Fulk
%T Solution to Machine Inductive Interference Problem P3
%J |BEATCS|
%V 19
%D februari 1983
%P 8
%Z Technical Contributions

%A Gheorghe P\v{a}un
%T A Positive Answer to Problem P11: There are inherently ambiguous
   context-free languages that have inherently ambiguous context-free complements
%J |BEATCS|
%V 19
%D februari 1983
%P 9-10
%Z Technical Contributions

%A R. Verraedt
%A P. De~Bra
%A M. Gyssens
%T A Solution to P11
%J |BEATCS|
%V 19
%D februari 1983
%P 10-11
%Z Technical Contributions

%A Andr\'e Arnold
%T A Solution to Problem 12
%J |BEATCS|
%V 19
%D februari 1983
%P 12-13
%Z Technical Contributions

%A L. Boasson
%T An Answer to P12: $www^R$ is cube-free
%J |BEATCS|
%V 19
%D februari 1983
%P 13-14
%Z Technical Contributions

%A Max Crochemore
%T A Solution to P12 (number 18, October 1982)
%J |BEATCS|
%V 19
%D februari 1983
%P 15-16
%Z Technical Contributions

%A A. Ehrenfeucht
%A G. Rozenberg
%T A Solution to P12
%J |BEATCS|
%V 19
%D februari 1983
%P 16-18
%Z Technical Contributions

%A Tero Harju
%T On Repetition Free Morphisms
%J |BEATCS|
%V 19
%D februari 1983
%P 18-20
%Z Technical Contributions

%A S. Istrail
%T A Solution to Wegner's Problem P12
%J |BEATCS|
%V 19
%D februari 1983
%P 20-24
%Z Technical Contributions

%A Veikko Ker\"anen
%T On L.~Wegner's Problem in the General Case
%J |BEATCS|
%V 19
%D februari 1983
%P 24-31
%Z Technical Contributions

%A Jan Willem Klop
%T A Solution to Problem P12 (number 18, October 1982)
%J |BEATCS|
%V 19
%D februari 1983
%P 31-33
%Z Technical Contributions

%A Sven Skyum
%T A Solution to P12 (number 18, October 1982)
%J |BEATCS|
%V 19
%D februari 1983
%P 34-37
%Z Technical Contributions

%A R. Verraedt
%A P. De~Bra
%A M. Gyssens
%T A Solution to P12
%J |BEATCS|
%V 19
%D februari 1983
%P 37-39
%Z Technical Contributions

%T A Solution to Berstel's Problem No P3
%A Max Crochemore
%J |BEATCS|
%V 18
%D october 1982
%P 9-11
%Z Technical Contributions
%X We give a negative answer to the following question:
   Is any uniform and weakly squarefree morphism
   defined on a three-letter alphabet squarefree?

%A Tero Harju
%T A Note on Infinite Words Obtained by Iterating Morphisms
%J |BEATCS|
%V 18
%D october 1982
%P 12-16
%Z Technical Contributions

%A Wolfgang H. Janko
%T A Bibliography on Randomized Algorithms
%J |BEATCS|
%V 18
%D october 1982
%P 16-26
%Z Technical Contributions

%A Mark H. Overmars
%T A O(1) Average Time Update Scheme for Balanced Search Trees
%J |BEATCS|
%V 18
%D october 1982
%P 27-29
%Z Technical Contributions

%A M. Paterson
%T A Solution to P8 (Number 17, June 1982)
%J |BEATCS|
%V 18
%D october 1982
%P 29
%Z Technical Contributions
%X An example of a non-regular context-free language
   accepted by a systolic binary tree automaton

%A John Case
%T Machine Inductive Interference Problems
%J |BEATCS|
%V 18
%D october 1982
%P 117-118
%Z Problems

%A Matthias Jantzen
%T Two Questions about [Inherently Ambiguous] Context-Free Languages
%J |BEATCS|
%V 18
%D october 1982
%P 119
%Z Problems

%A L. Wegner
%T Is $www^R$ Cube-Free?
%J |BEATCS|
%V 18
%D october 1982
%P 120
%Z Problems

%A E. Best
%T Representing a Program Invariant as a Linear Invariant in a Petri Net
%J |BEATCS|
%V 17
%D june 1982
%P 2-11
%Z Technical Contributions

%T Some Remarks on 'Non-regular C.F.L. and Pumping'
%A Maurice Blab
%J |BEATCS|
%V 17
%D june 1982
%P 11-13
%Z Technical Contributions

%A P. De Bra
%A J. Paredaens
%T A Note on Armstrong's Relation
%J |BEATCS|
%V 17
%D june 1982
%P 13-17
%Z Technical Contributions

%A Luuk P.J. Groenewegen
%T Decision Proceses and Parallel Programs
%J |BEATCS|
%V 17
%D june 1982
%P 18-33
%Z Technical Contributions

%A Anton Nijholt
%T An Annotated Bibliography of Pumping
%J |BEATCS|
%V 17
%D june 1982
%P 34-53
%Z Technical Contributions


%% BEATCS 16
%A Jan Bergstra
%T A propositional version of Hoare's Logic with modal operators
%P 2-13
%Z Technical Contributions
%D February 1982
%J |BEATCS|
%V 16

%A Horst Bunke
%T Representation of control in parallel programmed grammars
%P 13-22
%Z Technical Contributions
%D February 1982
%J |BEATCS|
%V 16

%A Karel Culik~II
%A J. Gruska
%A A. Salomaa
%T On non-regular context-free languages and pumping
%P 22-24
%Z Technical Contributions
%D February 1982
%J |BEATCS|
%V 16

%A H. Ehrig
%T Applications of conditional graph productions to consistency,
   synchronization and scheduling in data base systems
%P 24-30
%Z Technical Contributions
%D February 1982
%J |BEATCS|
%V 16

%A Jan Willem Klop
%T Extending partial combinatory algebras
%P 30-34
%Z Technical Contributions
%D February 1982
%J |BEATCS|
%V 16

%A H. Volger
%T Alternating Turing machines, bounded concatenation theories
   and the decision problem for first order theories: some examples
%P 34-36
%Z Technical Contributions
%D February 1982
%J |BEATCS|
%V 16

%% BEATCS 15
%A A. Salomaa
%T What computer scientists should know about SAUNA
%Z Special Features
%P 8-21
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%A J. Gruska
%T Ten years of MFCS
%Z Special Features
%P 21-31
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%A Ronald V. Book
%T Context-sensitive tally languages
%P 31-34
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%A H. Edelsbrunner
%T A note on dynamic range searching
%P 34-40
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%A Klaus P. Jantke
%T A characterization theorem on partial recursive functions and abstract data types
%P 40-46
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%A Hans-J\"org Kreowski
%T Playing the token game in an algebra -- Just a definition
%P 46-50
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%T Formal power series and one-way stack automata
%A W. Kuich
%P 50 -54
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%T Positions of symbols in context-free derivations
%A Jan van Leeuwen
%P 54-55
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%T A note on Park's problem
%A Mike Paterson
%P 55-56
%X (AB)^\omega = (BA)^\omega does not imply that (A^+B^+)^\omega = (AB)^\omega
   for regular languages A, B.
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%T On the compactification of programs 2
%A Tom Verhoeff
%P 56-59
%Z Technical Contributions
%V 15
%D October 1981
%J |BEATCS|

%T On the scientific activity of Laurent Chottin (1947-1979)
%P 139-146
%A Sorin Istrail
%Z Obituaries
%V 15
%D October 1981
%J |BEATCS|

%% BEATCS 14
%T Complete sets for the second level of the log-space hierarchy
%A Uwe Sch\"oning
%P 3-5
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T The \omega-equivalence problem for Tag systems with deletion number one is decidable
%A K. Culik~II
%P 6-7
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T Reporting and counting intersections of arcs on a circle
%A Mark H. Overmars
%P 7-15
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T On a problem
%A Christophe Reutenauer
%X (AB)^\omega = (BA)^\omega does not imply that (A^+B^+)^\omega = (AB)^\omega
   for (context-free) languages A, B.
%P 15-16
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T Arithmetical interpretations of dynamic logic (abstract)
%A Petr H\'ajek
%P 16-17
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T A propositional version of Hoare's logic
%A J.A. Bergstra
%A J. Terlouw
%P 18-25
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T A note on conflicts in Petri nets
%A Peter H. Starke
%P 26-33
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T Algebraic considerations on AFL's
%A J\"urgen Dassow
%A Rainer Ehrig
%P 34-36
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%T On the compactification of programs
%A K.R. Apt
%A C. Bongers
%A M. Stefanski
%P 37-39
%J |BEATCS|
%V 14
%D June 1981
%Z Technical Contributions

%% -----------
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions
%T Duality in addition chains
%A Christos H. Papadimitriou
%A Donald E. Knuth
%P 2-4

%A Jan van Leeuwen
%T An elementary fact about unambiguity
%P 4-6
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%A H. Edelsbrunner
%T Reporting intersections of geometric objects by means of covering rectangles
%P 7-11
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T Two examples to Skolem's problem
%A V. Claus
%P 11-12
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T Graph grammars which generate graphs with specified properties
%A Dieter Gernert
%P 13-20
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T A note on Z-sets being crossed up and down
%A Axel Poign\'e
%P 21-24
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T An equational class of I/O-computable datastructures that containes no
   recursive datastructure
%A J.A. Bergstra
%A J.-J. Ch. Meyer
%P 25-30
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T A 'hard-core' theorem for randomized algorithms
%A Shimon Even
%A Yacov Yacobi
%P 30-36
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T A note on the reduction of systems of fixed point equations
%A Francesco Parisi-Presicce
%P 37-41
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T A note on Arnold-Karpinski's seven equations bound for data specifications
%A J.-J. Ch. Meyer
%P 42-44
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T Implicit specification by algebraic domain equations
%A H.-D. Ehrig
%P 45-51
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T On induction for programming logic: Syntax, semantics, and inductive closure
%A Farshid Nourani
%P 51-64
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%A G. Rozenberg
%A J. M\"aenp\"a\"a
%A A. Salomaa
%T Supplementary bibliography of L-systems
%P 64-79
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions

%T Supplement to 'Multidimensional algorithms and data structures (bibliography)'
%A Herbert Edelsbrunner
%A Jan van Leeuwen
%P 79-85
%J |BEATCS|
%V 13
%D February 1981
%Z Technical Contributions



%% BEATCS 12
%A A. Arnold
%A M. Karpinski
%T An easy improvement of Bergstra-Meyer's 81 equations bound for data specifications
%P 7-9
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T On the Collatz-like rational games, Post factor replacement and
   commutative semi-Thue systems
%A E. B\"orger
%A M. Karpinksy
%P 10-12
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T 1980 Bibliography on graph rewriting systems (graph-grammars)
%A M. Nagl
%P 13-45
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T Graph rewriting systems as a tool for transforming descriptions of line drawings
%A Horst Bunke
%P 46-50
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T A number theoretic problem arising from a problem in automata theory
%A Peter van Emde~Boas
%A Marek Karpinski
%P 50-53
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T Some remarks on PCP(k) and related problems
%A Volker Claus
%P 54-61
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T A note on iterating inverse morphisms
%A Matthias Jantzen
%P 62-64
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T A comment on some existing simulation conceptions for (concurrent) systems
%A Andre Arnold
%A Lutz Priese
%P 65-66
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T Procedure call by pattern matching
%A Dieter Gernert
%A Gerhard Sammer
%P 66-75
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%T Bibliography on abstract software specification
%A Herbert A. Klaeren
%P 76-87
%J |BEATCS|
%V 12
%D October 1980
%Z Technical Contributions

%% BEATCS 11
%T Completeness in algebraic specifications
%A Hartmut Ehrig
%A Hans-J\"org Kreowski
%A Peter Padawitz
%P 2-9
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T Is binary notation optimal? (an open problem)
%A Klaus Weihrauch
%P 9-10
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T A theoretical basis for the systematic proof method
%A Wolfgang Bibel
%P 11
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T Conjugates and C.F. languages
%A L. Boasson
%P 12-13
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T Sixteen defenseless black knights,
   a challenging programming problem in computational combinatorics
%A A.L. Szilard
%P 14
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T Reducing 3DM to Clique and Hamiltonian Circuit
%A M.J. Fischer
%A J. van Leeuwen
%P 15-19
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T Intercalation theorems for derivation controlled Lindenmeyer systems
%A Gerald S. Eisman
%P 20-22
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T A natural data type with a finite equational final semantics specification
   but no effective equational initial semantics specification
%A J.A. Bergstra
%A J.V. Tucker
%P 23-33
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T Partial recursive functions and abstract data types
%A M. Broy
%A M. Wirsing
%P 34-41
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T A partial solution to B.~Reusch problem
%A J. Henno
%P 42-45
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%T Multidimensional algorithms and data structures (bibliography)
%A Herbert Edelsbrunner
%A Jan van Leeuwen
%P 46-74
%J |BEATCS|
%V 11
%D June 1980
%Z Technical Contributions

%% BEATCS 10
%T Ten thousand and one logics of programming
%A A.R. Meyer
%P 11-29
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T Remarks on linear context-free languages
%A Ronald V. Book
%P 30-31
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T A note on goodness of E0L forms
%A W. Ainhirn
%P 32-38
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T Nondeterminism cannot be explained deterministically
   -- a counterexample to a problem posed by Bernd Reusch
%P 38-39
%A Peter van Emde~Boas
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T Remarks on Reusch's nondeterminism problem
%A Peter H. Starke
%P 40-48
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T Computing minimal weight vertex covers in bipartite graphs
%A X. Berenguer
%A J. Diaz
%P 49-52
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T A density problem for context-free languages
%A W. Bucher
%P 53
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T Constructing a finite automaton for a given regular expression
%A Ernst Leiss
%P 54-59
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T New results on odd perfect numbers
   (preliminary announcement)
%A Dieter Gernert
%P 60-61
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions

%T On random son-trees (abstract)
%A H. Olivi\'e
%P 61
%J |BEATCS|
%V 10
%D January 1980
%Z Technical Contributions



%% =================================================
%A Jon Louis Bentley
%T Priority Queues with range restriction
%J |BEATCS|
%V 9
%D october 1979
%P 7-8
%Z Technical Contributions

%A Bernd Reusch
%T An Open Problem Concerning Non-Determinism
%J |BEATCS|
%V 9
%D october 1979
%P 9-10
%Z Technical Contributions

%A Jan van Leeuwen
%T Squaring a 2x2 matrix
%J |BEATCS|
%V 9
%D october 1979
%P 11-13
%Z Technical Contributions

%A Helmut Prodinger
%T A Remark concerning the Solution of a Linear Recurrence
%J |BEATCS|
%V 9
%D october 1979
%Z Technical Contributions
%P 13

%T Graph Grammars versus Discrete Dynamics
%A Hartmut Ehrig
%J |BEATCS|
%V 9
%D october 1979
%P 14-15
%Z Technical Contributions

%A Juhani Karhum\"aki
%A Imre Simon
%T A Note on Elementary Homomorphisms and the Regularity of Equality Sets
%J |BEATCS|
%V 9
%D october 1979
%P 16-24
%Z Technical Contributions

%A Dieter Gernert
%T Homogeneous Graph Grammars
%J |BEATCS|
%V 9
%D october 1979
%P 25-31
%Z Technical Contributions

%A C. M. Fiduccia
%T Remarks on a Note of Alt and van Leeuwen Regarding Products in Finite-dimensional Algebras
%J |BEATCS|
%V 9
%D october 1979
%P 32-33
%Z Technical Contributions

%A Hartmut Schmeck
%T A Note on Extending the Notion of Finite Index
%J |BEATCS|
%V 9
%D october 19979
%P 34-40
%Z Technical Contributions

%A Wolfram-M. Lippe
%T Context-Sensitive Top-Down Creative Dendrogrammars
%J |BEATCS|
%V 9
%D october 1979
%P 41-45
%Z Technical Contributions

%A H. Olivi\'e
%A J. Paredaens
%T On the Relationship Between Son-Trees and Symmetric Binary B-Trees
%J |BEATCS|
%V 9
%D october 1979
%P 45-46
%Z Technical Contributions

%A A. Bertoni
%A G. Mauri
%A P. A. Miglioli
%A M. Wirsing
%T On Different Approaches to Abstract Data Types and the Existence of Recursive Models
%J |BEATCS|
%V 9
%D october 1979
%P 47-57
%Z Technical Contributions

%A John Staples
%T Dynamics of Discrete Structures
%J |BEATCS|
%V 8
%D june 1979
%P 2-3
%Z Technical Contributions

%A Arto Salomaa
%T DOL Language Equivalence
%J |BEATCS|
%V 8
%D june 1979
%P 4-12
%Z Technical Contributions

%A J. M. Autebert
%A J. Beauquier
%A L. Boasson
%T Some Remarks about Minimal Rational Cones
%J |BEATCS|
%V 8
%D june 1979
%P 13
%Z Technical Contributions

%A Helmut Alt
%A Jan van Leeuwen
%T A Classroom Note on Computing Products in Finite-Dimensional Algebras
%J |BEATCS|
%V 8
%D june 1979
%P 14-17
%Z Technical Contributions

%A Dieter Gernert
%T Representation of knowledge by means of nonprocedural languages and their compilers
%J |BEATCS|
%V 8
%D june 1979
%P 18-24
%Z Technical Contributions

%A H. W. Barz
%A H. P. Zima
%T A Bibliography of Parallel Processing
%J |BEATCS|
%V 8
%D june 1979
%P 25-56
%Z Technical Contributions

%A Dieter Gernert
%T Measuring the Similarity of Complex Structures by Means of Graph Grammars
%J |BEATCS|
%V 7
%D februari 1979
%P 3-9
%Z Technical Contributions

%A Roland Backhouse
%A Stuart Anderson
%T Least-Cost Repair of Syntax Errors
%J |BEATCS|
%V 7
%D februari 1979
%P 10-14
%Z Technical Contributions

%T Blindfold games are harder than games with perfect information
%A Neil D. Jones
%P 4-7
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%T First results about Perrin \& Sch\"utzenberger conjecture
%A Mauro Buscarol
%P 7-8
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%T A short survey on the state of the art in matching and unification problems
%A P. Raulefs
%A J. Siekman
%A P. Szab\'o
%A E. Unvericht
%P 9-24
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%T PDA forms and strict interpretations
%A Derick Wood
%P 25-28
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%T A simple variable-free CF grammar generating a non regular language
%A J. Hagauer
%P 28-33
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%T Intermediate complexity in data matrix problems
%A F.N. Springsteel
%A Pavel Pudl\'ak
%P 33-35
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%T On a formal description of constraints in a data base scheme
%A J. Paredaens
%P 36-40
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%T Bibliography of van Wijngaarden grammars
%A Peter Deussen
%A Lutz Wegner
%P 41-46
%J |BEATCS|
%D October 1978
%V 6
%Z Technical Contributions

%A J.K. Price
%A D. Wotschke
%T The triple construction for converting a PDA into a CFG is sometimes optimal
%J |BEATCS|
%V 5
%D june 1978
%P 4-5
%Z Technical Contributions

%A H.D. Schulz
%T Garden of Eden-Configurations
%J |BEATCS|
%V 5
%D june 1978
%P 6-14
%Z Technical Contributions

%A M. Penttonen
%T The equivalence for realtime strict DPDA's is still open
%J |BEATCS|
%V 5
%D june 1978
%P 14
%Z Technical Contributions

%A D. Wood
%J |BEATCS|
%V 5
%D june 1978
%P 15-22
%Z Technical Contributions
%T Bibliography of Grammatical Similarity

%A M. Linna
%J |BEATCS|
%V 5
%D june 1978
%P 22-27
%Z Technical Contributions
%T The FPP-Problem for Regular Languages

%A D. Perrin
%A M.P. Sch\"utzenberger
%T A conjecture of differences of integer pairs
%J |BEATCS|
%V 5
%D june 1978
%P 27-29
%Z Technical Contributions

%A Joseph Ja'Ja'
%T Optimal Evaluation of Pairs of Bilinear Forms
%J |BEATCS|
%V 4
%D januari 1978
%P 2
%Z Technical Contributions

%A L. Boasson
%T A Remark on Ogden's Lemma
%J |BEATCS|
%V 4
%D januari 1978
%P 3-4
%Z Technical Contributions

%A Arto Salomaa
%T D0L Equivalence: the problem of iterated morphism
%J |BEATCS|
%V 4
%D januari 1978
%P 5-12
%Z Technical Contributions

%A Yoav Raz
%T 1L Systems with Bounded Interactions
%J |BEATCS|
%V 4
%D januari 1978
%P 13-19
%Z Technical Contributions

%A Th. Ottmann
%T On log(n) Solutions of the Dictionary Problem for one-sided height-balanced binary search trees
%J |BEATCS|
%V 4
%D januari 1978
%P 20-25
%Z Technical Contributions

%A Martti Penttonen
%T The Decidability of the Equivalence Problem for Realtime Strict Deterministic Pushdown Automata
%J |BEATCS|
%V 4
%D januari 1978
%P 26-29
%Z Technical Contributions

%A Derick Wood
%T A Bibliography of Top-Down Deterministic Parsing
%J |BEATCS|
%V 4
%D januari 1978
%P 30-35
%Z Technical Contributions

%A B. Courcelle
%T The Equivalence Problem for Realtime DPDA's
%J |BEATCS|
%V 3
%D october 1977
%P 6-9
%Z Technical Contributions

%T Sur une transduction rationelle
%A L. Boasson
%P 11-14
%J |BEATCS|
%V 2
%D December 1976
%Z Short Research Notes

%T Complexity of mechanized hypothesis formation
   (abstract)
%A P. Pudl\'ak
%A F. Springsteel
%P 15-18
%J |BEATCS|
%V 2
%D December 1976
%Z Short Research Notes