Search Results - "[INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC]"

  • Showing 1 - 9 results of 9
Refine Results
  1. 1

    Non-Determinism and Nash Equilibria for Sequential Game over Partial Order by Le Roux, Stéphane

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: Centre pour la Communication Scientifique Directe (CCSD) 01.01.2005
    “…In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium. But if…”
    Get full text
    Journal Article Conference Proceeding
  2. 2

    Algebraic Elimination of epsilon-transitions by Gérard Duchamp, Hatem Hadj Kacem, Eric Laugerotte

    ISSN: 1365-8050
    Published: Discrete Mathematics & Theoretical Computer Science 01.01.2005
    “…We present here algebraic formulas associating a k-automaton to a k-epsilon-automaton. The existence depends on the definition of the star of matrices and of…”
    Get full text
    Journal Article
  3. 3

    Solving equations over small unary algebras by Broniek, Przemyslaw

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: DMTCS 01.01.2005
    “…We consider the problem of solving a system of polynomial equations over fixed algebra $A$ which we call MPolSat($A$). We restrict ourselves to unary algebras…”
    Get full text
    Journal Article Conference Proceeding
  4. 4

    Undecidable problems concerning densities of languages by Kozik, Jakub

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: DMTCS 01.01.2005
    “…In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no…”
    Get full text
    Journal Article Conference Proceeding
  5. 5

    Classical Combinatory Logic by Nour, Karim

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: DMTCS 01.01.2005
    “…Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and…”
    Get full text
    Journal Article Conference Proceeding
  6. 6

    The call-by-value λµ∧∨-calculus by Nour, Karim, Saber, Khelifa

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: DMTCS 01.01.2005
    “…In this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an…”
    Get full text
    Journal Article Conference Proceeding
  7. 7

    On-line Adaptive Chain Covering of Upgrowing Posets by Bosek, Bartłomiej, Micek, Piotr

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: DMTCS 01.01.2005
    “…We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time…”
    Get full text
    Journal Article Conference Proceeding
  8. 8

    On-line coloring of $I_s$-free graphs by Cieslik, Iwona, Kozik, Marcin, Micek, Piotr

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: DMTCS 01.01.2005
    “…An on-line vertex coloring algorithm receives vertices of a graph in some externally determined order. Each new vertex is presented together with a set of the…”
    Get full text
    Journal Article Conference Proceeding
  9. 9

    Random Boolean expressions by Gardy, Danièle

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Published: DMTCS 01.01.2005
    “…We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation…”
    Get full text
    Journal Article Conference Proceeding