Result 261 to 280 of 345 total
Maximal circular codes versus maximal codes. (English)
Theor. Inform. Appl. 35, No.4, 351-365 (2001).
261
Towards parametrizing word equations. (English)
Theor. Inform. Appl. 35, No. 4, 331-350 (2001).
262
Automata-based representations for infinite graphs. (English)
Theor. Inform. Appl. 35, No.4, 311-330 (2001).
263
On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem. (English)
Theor. Inform. Appl. 35, No.3, 287-309 (2001).
264
Depth lower bounds for monotone semi-unbounded fan-in circuits. (English)
Theor. Inform. Appl. 35, No. 3, 277-286 (2001).
265
Division in logspace-uniform NC. (English)
Theor. Inform. Appl. 35, No.3, 259-275 (2001).
266
Number-conserving reversible cellular automata and their computation-universality. (English)
Theor. Inform. Appl. 35, No.3, 239-258 (2001).
267
The $I$-types of system $\cal F$. (Les $I$-types du système $\cal F$.) (French)
Theor. Inform. Appl. 35, No.3, 223-237 (2001).
268
Syntactical data types of system $\cal F$. (Les types de données syntaxiques du système $\cal F$.) (French)
Theor. Inform. Appl. 35, No.3, 207-221 (2001).
269
On the number of iterations required by von Neumann addition. (English)
Theor. Inform. Appl. 35, No. 2, 187-206 (2001).
270
On the stack-size of general tries. (English)
Theor. Inform. Appl. 35, No.2, 163-185 (2001).
271
Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication. (English)
Theor. Inform. Appl. 35, No.2, 149-162 (2001).
272
PAC learning under helpful distributions. (English)
Theor. Inform. Appl. 35, No.2, 129-148 (2001).
273
A generalisation of entity and referential integrity in relational databases. (English)
Theor. Inform. Appl. 35, No.2, 113-127 (2001).
274
Coalgebras for binary methods: Properties of bisimulations and invariants. (English)
Theor. Inform. Appl. 35, No.1, 83-111 (2001).
275
A coalgebraic semantics of subtyping. (English)
Theor. Inform. Appl. 35, No.1, 61-81 (2001).
276
Many-sorted coalgebraic modal logic: A model-theoretic study. (English)
Theor. Inform. Appl. 35, No.1, 31-59 (2001).
277
Integrating observational and computational features in the specification of state-based, dynamical systems. (English)
Theor. Inform. Appl. 35, No.1, 1-29 (2001).
278
Special issue: Coalgebraic methods in computer science. Papers of the 3rd workshop CMCS, Berlin, Germany, March 25‒26, 2000. (English)
Theor. Inform. Appl. 35, No.1, 111 p. (2001).
279
Codes which are minimal generators of languages of biinfinite words. (Codes générateurs minimaux de langages de mots bi-infinis.) (French)
Theor. Inform. Appl. 34, No.6, 585-596 (2000).
280
Result 261 to 280 of 345 total
Start
Contact
Print
General Help
