Decidability of the multiplicity equivalence of multitape finite automata
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Learning Sat-k-DNF formulas from membership queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Direct and dual laws for automata with multiplicities
Theoretical Computer Science
Forty years of formal power series in automata theory
A half-century of automata theory
An algebraic characterization of the set of succession rules
Theoretical Computer Science
Uni-transitional Watson-Crick DOL systems
Theoretical Computer Science
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
The monadic theory of morphic infinite words and generalizations
Information and Computation
A non-ambiguous decomposition of regular languages and factorizing codes
Discrete Applied Mathematics
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
The Monadic Theory of Morphic Infinite Words and Generalizations
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Rational Transformations of Formal Power Series
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Constructing Finite Maximal Codes from Schützenberger Conjecture
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
On the Enumerative Sequences of Regular Languages on k Symbols
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Operations over Automata with Multiplicities
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Brzozowski's Derivatives Extended to Multiplicities
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
A new class of algebraic series having a decidable equivalence problem
Fundamenta Informaticae
On images of DOL and DTOL power series
Theoretical Computer Science
One application of real-valued interpretation of formal power series
Theoretical Computer Science
Watson--Crick D0L systems: the power of one transition
Theoretical Computer Science
Decidability results for Watson--Crick D0L systems with nonregular triggers
Theoretical Computer Science
On transformations of formal power series
Information and Computation
A note on commutative multivariate rational series
Information Processing Letters
On the generating sequences of regular languages on k symbols
Journal of the ACM (JACM)
Finite-state transducers in language and speech processing
Computational Linguistics
Computational Linguistics
Review of "The functional treatment of parsing" by René Leermakers. Kluwer Academic Publishers 1993.
Computational Linguistics
Dynamic compilation of weighted context-free grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Derivatives of rational expressions and related theorems
Theoretical Computer Science - Implementation and application automata
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Rational Kernels: Theory and Algorithms
The Journal of Machine Learning Research
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
An optimal pre-determinization algorithm for weighted transducers
Theoretical Computer Science - Implementation and application of automata
Branching automata with costs: a way of reflecting parallelism in costs
Theoretical Computer Science - Implementation and application of automata
Weak minimization of DFA: an algorithm and applications
Theoretical Computer Science - Implementation and application of automata
The language equivalence problem for HD0L systems having D0L growths
Theoretical Computer Science - Insightful theory
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Theoretical Computer Science - Insightful theory
Generalized algorithms for constructing statistical language models
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A general regression technique for learning transductions
ICML '05 Proceedings of the 22nd international conference on Machine learning
Theoretical Computer Science - Mathematical foundations of computer science 2004
A language-theoretic approach to covering problems
Journal of Automata, Languages and Combinatorics
Gröbner bases and the defining polynomial of a context-free grammar generating function
Journal of Automata, Languages and Combinatorics
Positivity of second order linear recurrent sequences
Discrete Applied Mathematics
Pattern statistics and Vandermonde matrices
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Finitely presentable tree series
Acta Cybernetica
Statistical modeling for unit selection in speech synthesis
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
On the Problem Whether the Image of an N-Rational Series Equals
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Characterizations of recognizable picture series
Theoretical Computer Science
Weighted asynchronous cellular automata
Theoretical Computer Science
Skew and infinitary formal power series
Theoretical Computer Science
Weighted tree automata and weighted logics
Theoretical Computer Science
Combinatorial aspects of L-convex polyominoes
European Journal of Combinatorics
Regular languages and their generating functions: The inverse problem
Theoretical Computer Science
Another proof of Soittola's theorem
Theoretical Computer Science
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
Sequence kernels for predicting protein essentiality
Proceedings of the 25th international conference on Machine learning
Weighted automata with discounting
Information Processing Letters
The number of convex permutominoes
Information and Computation
N-rationality of a certain class of formal series
Information Processing Letters
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Tree-Series-to-Tree-Series Transformations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
3-Way Composition of Weighted Finite-State Transducers
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
On Rational Stochastic Languages
Fundamenta Informaticae
Preferential Regular Path Queries
Fundamenta Informaticae
Absolute Convergence of Rational Series Is Semi-decidable
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Learning with Weighted Transducers
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Digital Images: Weighted Automata Theoretical Aspects
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
Positivity of third order linear recurrence sequences
Discrete Applied Mathematics
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Communication: Positivity of second order linear recurrent sequences
Discrete Applied Mathematics
Conditional Densities of Regular Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Edit-distance of weighted automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An efficient pre-determinization algorithm
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Branching automata with costs: a way of reflecting parallelism in costs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Learning languages with rational kernels
COLT'07 Proceedings of the 20th annual conference on Learning theory
Weighted and unweighted trace automata
Acta Cybernetica
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Weighted automata and weighted logics with discounting
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On generalizations of weighted finite automata and graphics applications
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Recognizable picture languages and polyominoes
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
A Kleene-Schützenberger theorem for weighted timed automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Expected sequence similarity maximization
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
On the joint spectral radius for bounded matrix languages
RP'10 Proceedings of the 4th international conference on Reachability problems
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Varieties of recognizable tree series over fields
Theoretical Computer Science
Coping with selfish on-going behaviors
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
Absolute convergence of rational series is semi-decidable
Information and Computation
Information Processing Letters
Large-scale training of SVMs with automata kernels
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Regular expressions on average and in the long run
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Definability of combinatorial functions and their linear recurrence relations
Fields of logic and computation
A unifying Kleene theorem for weighted finite automata
Rainbow of computer science
On some biologically motivated control devices for parallel rewriting
Computation, cooperation, and life
MWU-aware part-of-speech tagging with a CRF model and lexical resources
MWE '11 Proceedings of the Workshop on Multiword Expressions: from Parsing and Generation to the Real World
Weighted finite automata: computing with different topologies
UC'11 Proceedings of the 10th international conference on Unconventional computation
Coping with selfish on-going behaviors
Information and Computation
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Weighted asynchronous cellular automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Learning rational stochastic languages
COLT'06 Proceedings of the 19th annual conference on Learning Theory
On the equivalence of Z-automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Index-based incremental language model for scalable directory assistance
Speech Communication
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Theoretical Computer Science
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
The inclusion problem for unambiguous rational trace languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
A coalgebraic perspective on linear weighted automata
Information and Computation
The lempel-ziv complexity of fixed points of morphisms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Algebraic generating functions in enumerative combinatorics and context-free languages
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Pattern occurrences in multicomponent models
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the maximum coefficients of rational formal series in commuting variables
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Using pseudo-stochastic rational languages in probabilistic grammatical inference
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Rational transformations and a kleene theorem for power series over rational monoids
Algebraic Foundations in Computer Science
Algebraic systems and pushdown automata
Algebraic Foundations in Computer Science
Efficient computation of the relative entropy of probabilistic automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Theoretical Computer Science
Note: Marked D0L systems and the 2n-conjecture
Theoretical Computer Science
Inference of fuzzy regular pattern grammar
Pattern Recognition Letters
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
On Rational Stochastic Languages
Fundamenta Informaticae
Preferential Regular Path Queries
Fundamenta Informaticae
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
Generating functions of timed languages
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
On the Problem Whether the Image of an N-Rational Series Equals
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A new class of algebraic series having a decidable equivalence problem
Fundamenta Informaticae
Decision Problems Concerning a Power Series Generalization of DTOL Systems
Fundamenta Informaticae
ON A POWER SERIES GENERALIZATION OF ETOL LANGUAGES
Fundamenta Informaticae
ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA
Fundamenta Informaticae
Fundamenta Informaticae
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
Weighted nested word automata and logics over strong bimonoids
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
A representation theorem for (q-)holonomic sequences
Journal of Computer and System Sciences
Decision Problems for Probabilistic Finite Automata on Bounded Languages
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Equations for Asynchronous Message Passing
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.02 |