Preface
From MaRDI portal
Publication:5898759
DOI10.1051/ita:2005031zbMath1117.01301OpenAlexW4238925402MaRDI QIDQ5898759
Christian Choffrut, Paola Campadelli, Massimiliano Goldwurm, Mauro Torelli
Publication date: 10 April 2007
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_2_R5_0
Cites Work
- Implicit parallelism in genetic algorithms
- Counting problems and algebraic formal power series in noncommuting variables
- On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
- The complexity of computing the number of strings of given length in context-free languages
- Asymmetric Boltzmann machines
- Grammatiche context-free su spazi metrici compatti
- Three efficient algorithms for counting problems
- Approximability of the ground state problem for certain Ising spin glasses
- An optimal lower bound for nonregular languages
- Efficient learning with equivalence queries of conjunctions of modulo functions
- On the number of occurrences of a symbol in words of regular languages.
- A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
- Membership problems for regular and context-free trace languages
- Regular languages accepted by quantum automata
- Local limit properties for pattern statistics and rational models
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- Ranking and formal power series
- Random Generation for Finitely Ambiguous Context-free Languages
- Strong optimal lower bounds for Turing machines that accept nonregular languages
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES
- On the approximability of the energy function of Ising spin glasses
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
- STACS 2004
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Theoretical Computer Science
- Analogies and differences between quantum and stochastic automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Preface
