Contents of Fundamenta Informaticae Volume 104


Number 1-2,  2010

Number 3,  2010

Number 4,  2010


Contents of Volume 104, Number 1-2, 2010

Click on title for abstract


Non-Classical Models of Automata and Applications - Preface.

Behaviours of Unary Quantum Automata
Maria Paola Bianchi,  Beatrice Palano

Clearing Restarting Automata
Peter Cerno,  Frantisek Mráz

One Pebble Versus e·logn Bits
Viliam Geffert,  Carlo Mereghetti,  Giovanni Pighizzini

5'®3' Watson-Crick Automata With Several Runs
Peter Leupold,  Benedek Nagy

Low Disruption Transformations on Cyclic Automata
Gema M. Martín,  Francisco J. Vico,  Jürgen Dassow, Bianca Truthe

Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
Tomás Masopust

Automorphism Classification of Cellular Automata
Hidenosuke Nishio 

Cellular Automata, Decidability and Phasespace
K. Sutner 

Target Based Accepting Networks of Evolutionary Processors
Bianca Truthe


Contents of Volume 104, Number 3, 2010

Click on title for abstract


Hardest Boolean Functions and O.B. Lupanov - Preface.

A Communication Approach to the Superposition Problem
Farid Ablayev,  Svetlana Ablayeva

A Note on a priori Estimations of Classification Circuit Complexity
Andreas A. Albrecht,  Alexander V. Chashkin,   Costas S. Iliopoulos,  Oktay M. Kasim-Zade,  Georgios Lappas,  Kathleen K. Steinhöfel

Synthesis and Complexity of Asymptotically Optimal Circuits with Unreliable Gates
Marina An. Alekhina

Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Sergej B. Gashkov,  Igor B. Gashkov

High Accuracy Asymptotic Bounds on the BDD Size and Weight of the Hardest Functions
Sergei A. Lozhkin,  Alexander E. Shiganov

Extended Nondeterministic Finite Automata
Boris Melnikov

Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems
Boris Melnikov

Greedy Algorithm with Weights for Decision Tree Construction
Mikhail Ju. Moshkov


Contents of Volume 104, Number 4, 2010

Click on title for abstract


Modeling Contexts with Dependent Types
Richard Dapoigny,  Patrick Barlatier

Univariate Equations Over Sets of Natural Numbers
Artur Jeż,  Alexander Okhotin

Horn Knowledge Bases in Regular Description Logics with PTime Data Complexity
Linh Anh Nguyen

Breaking Pomykala-Barabasz Threshold Proxy Signature Scheme
Zuhua Shao