default search action
Informatique Théorique et Applications, Volume 28
Volume 28, Number 1, 1994
- Laureano González-Vega, Henri Lombardi, Tomás Recio, Marie-Françoise Roy:
Spécialisation de la suite de Sturm. 1-24 - Hans-Peter Lenhof, Michiel H. M. Smid:
Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. 25-49 - Dung T. Huynh, Lu Tian:
On Deciding some Equivalences for Concurrent Processes. 51-71
Volume 28, Number 2, 1994
- Alain Finkel, Laure Petrucci:
Composition/décomposition de réseaux de petri et de leurs graphes de couverture. 73-124 - Olivier Coudert, Jean Christophe Madre:
Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes. 125-149
Volume 28, Numbers 3-4, 1994
- Carl-Johan H. Seger, Janusz A. Brzozowski:
Generalized Ternary Simulation of Sequential Circuits. 159-186 - C. C. Koung, Jaroslav Opatrny:
Multidimensional Linear Congruential Graphs. 187-199 - Hermann A. Maurer, Frank Kappe:
Theory as Basis for Advances in Hypermedia. 201-211 - Jan K. Pachl:
A Proof of Protocol Correctness. 213-220 - Kai Salomaa, Derick Wood, Sheng Yu:
Pumping and Pushdown Machines. 221-232 - Alexandru Mateescu, Arto Salomaa:
Finite Degrees of Ambiguity in Pattern Languages. 233-253 - Jean Berstel, Patrice Séébold:
A Remark on Morphic Sturmian Words. 255-263 - Christian Choffrut:
Bijective Sequential Mappings of a Free Monoid Onto Another. 265-276 - Imre Simon:
On Semigroups of Matrices over the Tropical Semiring. 277-294 - Tero Harju, N. W. Keesmaat, H. C. M. Kleijn:
The Intersection Problem for Alphabetic Vector Monoids. 295-301 - Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská:
The Complexity of Systolic Dissemination of Information in Interconnection Networks. 303-342 - Jarkko Kari, Pasi Fränti:
Arithmetic Coding of Weighted Finite Automata. 343-360 - Wolfgang Merzenich, Ludwig Staiger:
Fractals, Dimension, and Formal Languages. 361-386 - Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Continuous Functions Computed by Finite Automata. 387-403 - Simant Dube:
Fractal Geometry, Turing Machines and Divide-and-Conquer Recurrences. 405-423
Volume 28, Number 5, 1994
- Tony W. Lai, Derick Wood:
Updating Approximately Complete Trees. 431-446 - Yves Andre, Max Dauchet:
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers. 447-463 - Viliam Geffert:
A Hierarchy That Does Not Collapse: Alternations in Low Level Space. 465-512
Volume 28, Number 6, 1994
- Fabio Alessi, Franco Barbanera:
Toward A Semantics for the Quest Language. 513-555 - Peter Ruzicka, Juraj Waczulík:
Pebbling Dynamic Graphs in Minimal Space. 557-565 - Foto N. Afrati:
The Hamilton Circuit Problem on Grids. 567-582
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.