| Publication | Date of Publication | Type |
|---|
On languages accepted with simultaneous complexity bounds and their ranking problem
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Exact algorithms for size constrained 2-clustering in the plane
Theoretical Computer Science | 2016-05-27 | Paper |
On the decidability of the intersection problem for quantum automata and context-free languages
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Exact algorithms for 2-clustering with size constraints in the Euclidean plane
Lecture Notes in Computer Science | 2015-02-20 | Paper |
A neural network algorithm for semi-supervised node label learning from unbalanced data
Neural Networks | 2014-08-04 | Paper |
Quantum finite automata and linear context-free languages: a decidable problem
Developments in Language Theory | 2013-06-28 | Paper |
Regularity of languages defined by formal series with isolated cut point
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
Size constrained distance clustering: separation properties and some complexity results
Fundamenta Informaticae | 2012-05-11 | Paper |
Learning functional linkage networks with a cost-sensitive approach
| 2011-04-12 | Paper |
The inclusion problem of context-free languages: some tractable cases
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
Trace monoids with idempotent generators and measure-only quantum automata
Natural Computing | 2010-09-16 | Paper |
Strong optimal lower bounds for Turing machines that accept nonregular languages
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Lower bounds on the size of quantum automata accepting unary languages.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
The Inclusion Problem of Context-Free Languages: Some Tractable Cases
Developments in Language Theory | 2009-07-07 | Paper |
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
Fundamenta Informaticae | 2009-06-23 | Paper |
Context-Free Grammars and XML Languages
Developments in Language Theory | 2009-03-26 | Paper |
APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids
Developments in Language Theory | 2007-11-28 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
On the Complexity of Unary Tiling-Recognizable Picture Languages
STACS 2007 | 2007-09-03 | Paper |
Local limit properties for pattern statistics and rational models
Theory of Computing Systems | 2006-10-25 | Paper |
Some formal tools for analyzing quantum automata.
Theoretical Computer Science | 2006-05-18 | Paper |
GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Small size quantum automata recognizing some regular languages
Theoretical Computer Science | 2005-08-01 | Paper |
scientific article; zbMATH DE number 2051177 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 2040892 (Why is no real title available?)
| 2004-02-11 | Paper |
scientific article; zbMATH DE number 2018620 (Why is no real title available?)
| 2003-12-16 | Paper |
On the number of occurrences of a symbol in words of regular languages.
Theoretical Computer Science | 2003-08-17 | Paper |
Regular languages accepted by quantum automata
Information and Computation | 2003-01-14 | Paper |
Random Generation for Finitely Ambiguous Context-free Languages
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Discontinuous finite element methods for the simulation of rotating electrical machines
COMPEL | 2002-06-17 | Paper |
A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
Algorithmica | 2002-06-17 | Paper |
Analogies and differences between quantum and stochastic automata
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1500544 (Why is no real title available?)
| 2001-06-13 | Paper |
scientific article; zbMATH DE number 1504577 (Why is no real title available?)
| 2001-05-06 | Paper |
Approximability of the ground state problem for certain Ising spin glasses
Journal of Complexity | 1999-11-29 | Paper |
scientific article; zbMATH DE number 1107723 (Why is no real title available?)
| 1998-06-11 | Paper |
Efficient learning with equivalence queries of conjunctions of modulo functions
Information Processing Letters | 1997-02-27 | Paper |
On the approximability of the energy function of Ising spin glasses
Journal of Physics A: Mathematical and General | 1996-07-17 | Paper |
scientific article; zbMATH DE number 790954 (Why is no real title available?)
| 1996-05-05 | Paper |
Corrigendum to ``An optimal lower bound for nonregular languages
Information Processing Letters | 1996-03-18 | Paper |
scientific article; zbMATH DE number 679806 (Why is no real title available?)
| 1995-12-18 | Paper |
A PARALLEL ALGORITHM FOR THE HADAMARD PRODUCT OF HOLONOMIC FORMAL SERIES
International Journal of Algebra and Computation | 1995-05-11 | Paper |
scientific article; zbMATH DE number 1053272 (Why is no real title available?)
| 1995-01-01 | Paper |
An optimal lower bound for nonregular languages
Information Processing Letters | 1994-07-21 | Paper |
On 2PFA's and the Hadamard quotient of formal power series
Bulletin of the Belgian Mathematical Society - Simon Stevin | 1994-06-15 | Paper |
Implicit parallelism in genetic algorithms
Artificial Intelligence | 1993-10-17 | Paper |
On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
RAIRO - Theoretical Informatics and Applications | 1993-06-29 | Paper |
HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES
International Journal of Foundations of Computer Science | 1993-01-16 | Paper |
Asymmetric Boltzmann machines
Biological Cybernetics | 1992-06-27 | Paper |
The complexity of computing the number of strings of given length in context-free languages
Theoretical Computer Science | 1992-06-26 | Paper |
scientific article; zbMATH DE number 8767 (Why is no real title available?)
| 1992-06-25 | Paper |
Ranking and formal power series
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4201667 (Why is no real title available?)
| 1990-01-01 | Paper |
Counting problems and algebraic formal power series in noncommuting variables
Information Processing Letters | 1990-01-01 | Paper |
Membership problems for regular and context-free trace languages
Information and Computation | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4114058 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4058887 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4116001 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4033108 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4024789 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4045155 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4020497 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3986645 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3905850 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3903969 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3936490 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3841217 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3808972 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3765179 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3874641 (Why is no real title available?)
| 1982-01-01 | Paper |
An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
Lecture Notes in Computer Science | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3793389 (Why is no real title available?)
| 1981-01-01 | Paper |
On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
Information Processing Letters | 1981-01-01 | Paper |
Sulla complessita di alcuni problemi di conteggio
Calcolo | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3639138 (Why is no real title available?)
| 1979-01-01 | Paper |
Three efficient algorithms for counting problems
Information Processing Letters | 1979-01-01 | Paper |
ANALYSIS AND COMPACTING OF MUSICAL TEXTS
Journal of Cybernetics | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3572058 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3569839 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3609674 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3513703 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3513702 (Why is no real title available?)
| 1975-01-01 | Paper |
Grammatiche context-free su spazi metrici compatti
Calcolo | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3444814 (Why is no real title available?)
| 1973-01-01 | Paper |
