6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
Operations Which Preserve Path-Width at Most Two
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 02 October 2001, pp. 277-291
-
- Article
- Export citation
Matroids Having Small Circumference
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 02 October 2001, pp. 349-360
-
- Article
- Export citation
On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 02 October 2001, pp. 361-366
-
- Article
- Export citation
A Note on Vertex List Colouring
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 02 October 2001, pp. 345-347
-
- Article
- Export citation
Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov Chains
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 02 October 2001, pp. 293-308
-
- Article
- Export citation
Commutative images of rational languages and the Abelian kernel of a monoid
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 419-435
- Print publication:
- September 2001
-
- Article
- Export citation
Linear size test sets for certain commutative languages
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 453-475
- Print publication:
- September 2001
-
- Article
- Export citation
A test-set for k-power-free binary morphisms
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 437-452
- Print publication:
- September 2001
-
- Article
- Export citation
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 477-490
- Print publication:
- September 2001
-
- Article
- Export citation
On graph products of automatic monoids
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 403-417
- Print publication:
- September 2001
-
- Article
- Export citation
Maximal circular codes versus maximal codes
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 351-365
- Print publication:
- July 2001
-
- Article
- Export citation
Atoms and partial orders of infinite languages
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 389-401
- Print publication:
- July 2001
-
- Article
- Export citation
Automata-based Representations for Infinite Graphs
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 311-330
- Print publication:
- July 2001
-
- Article
- Export citation
On the expressive power of the shuffle operator matched with intersection by regular sets
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 379-388
- Print publication:
- July 2001
-
- Article
- Export citation
Towards parametrizing word equations
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 331-350
- Print publication:
- July 2001
-
- Article
- Export citation
The Helping Hierarchy
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 4 / July 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 367-377
- Print publication:
- July 2001
-
- Article
- Export citation
Modal Logic
-
- Published online:
- 05 July 2014
- Print publication:
- 28 June 2001
2 - Models
-
- Book:
- Modal Logic
- Published online:
- 05 July 2014
- Print publication:
- 28 June 2001, pp 50-122
-
- Chapter
- Export citation
3 - Frames
-
- Book:
- Modal Logic
- Published online:
- 05 July 2014
- Print publication:
- 28 June 2001, pp 123-187
-
- Chapter
- Export citation
Appendix B - An Algebraic Toolkit
-
- Book:
- Modal Logic
- Published online:
- 05 July 2014
- Print publication:
- 28 June 2001, pp 497-503
-
- Chapter
- Export citation