Decidability of the multiplicity equivalence of multitape finite automata
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the computational power of neural nets
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning Sat-k-DNF formulas from membership queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Algorithmic aspects in speech recognition: an introduction
Journal of Experimental Algorithmics (JEA)
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Direct and dual laws for automata with multiplicities
Theoretical Computer Science
On some Schützenberger conjectures
Information and Computation
Forty years of formal power series in automata theory
A half-century of automata theory
Asymptotic behavior in a heap model with two pieces
Theoretical Computer Science
Electronic Markets, Hierarchies, Hubs, and Intermediaries
Information Systems Frontiers
Transitive factorizations of free partially commutative monoids and Lie algebras
Discrete Mathematics
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
Linear languages with a nonassociative concatenation
Journal of Automata, Languages and Combinatorics
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Bilinear Functions and Trees over the (max, +) Semiring
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Factorizing Codes and Schützenberger Conjectures
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Derivation of Rational Expressions with Multiplicity
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
On the Average Parallelism in Trace Monoids
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compositional Performance Analysis Using Probabilistic I/O Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Operations over Automata with Multiplicities
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
SEA: A Symbolic Environment for Automata Theory
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
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
Decision Questions on Integer Matrices
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The finite power property in free groups
Theoretical Computer Science
A solution to the problem of (A,B)-invariance for series
Theoretical Computer Science
On the sentence valuation in a semiring
Information Sciences—Informatics and Computer Science: An International Journal
A new class of algebraic series having a decidable equivalence problem
Fundamenta Informaticae
On images of DOL and DTOL power series
Theoretical Computer Science
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
Decidability results for Watson--Crick D0L systems with nonregular triggers
Theoretical Computer Science
Coinductive counting with weighted automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
On transformations of formal power series
Information and Computation
On the generating sequences of regular languages on k symbols
Journal of the ACM (JACM)
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Finite-state transducers in language and speech processing
Computational Linguistics
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
Scheduling hard sporadic tasks with regular languages and generating functions
Theoretical Computer Science - Implementation and application automata
Rational Kernels: Theory and Algorithms
The Journal of Machine Learning Research
Frequency of symbol occurrences in bicomponent stochastic models
Theoretical Computer Science - Developments in language theory
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
A coinductive calculus of streams
Mathematical Structures in Computer Science
Branching automata with costs: a way of reflecting parallelism in costs
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
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Simpler and more general minimization for weighted finite-state automata
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Generalized algorithms for constructing statistical language models
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Weighted rational transductions and their application to human language processing
HLT '94 Proceedings of the workshop on Human Language Technology
An enhanced property of factorizing codes
Theoretical Computer Science - The art of theory
Theoretical Computer Science - The art of theory
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
A language-theoretic approach to covering problems
Journal of Automata, Languages and Combinatorics
Uniform random sampling of traces in very large models
Proceedings of the 1st international workshop on Random testing
Codes, unambiguous automata and sofic systems
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Pattern statistics and Vandermonde matrices
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Rationality of the Möbius function of a composition poset
Theoretical Computer Science
On the equivalence of weighted finite-state transducers
ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
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
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Skew and infinitary formal power series
Theoretical Computer Science
Weighted tree automata and weighted logics
Theoretical Computer Science
Fuzzy Sets and Systems
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
Fundamenta Informaticae
Weighted automata with discounting
Information Processing Letters
N-rationality of a certain class of formal series
Information Processing Letters
A Joint Segmenting and Labeling Approach for Chinese Lexical Analysis
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Synchronization Problem for Strongly Transitive Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Partial Conway and Iteration Semirings
Fundamenta Informaticae
On Rational Stochastic Languages
Fundamenta Informaticae
Preferential Regular Path Queries
Fundamenta Informaticae
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Axiomatizing rational power series over natural numbers
Information and Computation
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
Compact Normal Form for Regular Languages as Xor Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Completing codes in a sofic shift
Theoretical Computer Science
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science
Supervisory Control of (max,+) Automata: A Behavioral Approach
Discrete Event Dynamic Systems
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
A stochastic finite-state morphological parser for Turkish
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Definable transductions and weighted logics for texts
Theoretical Computer Science
Component Simulation-based Substitutivity Managing QoS Aspects
Electronic Notes in Theoretical Computer Science (ENTCS)
Fuzzy Sets and Systems
Černý's conjecture and group representation theory
Journal of Algebraic Combinatorics: An International Journal
A coinductive calculus of binary trees
Information and Computation
Edit-distance of weighted automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Star normal form, rational expressions, and glushkov WFAs properties
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
The specker-blatter theorem revisited
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
From Glushkov WFAs to rational expressions
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Frequency of symbol occurrences in simple non-primitive stochastic models
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Deciding the sequentiality of a finitely ambiguous max-plus automaton
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
From regular weighted expressions to finite automata
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
Metrics and topology for nonlinear and hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Weighted and unweighted trace automata
Acta Cybernetica
Kleene revisited by Suschkewitsch
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
Average value and variance of pattern statistics in rational models
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
The algebraic approach II: dioids, quantales and monads
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
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
Myhill-Nerode theorem for recognizable tree series revisited
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Trace monoids with idempotent generators and measure-only quantum automata
Natural Computing: an international journal
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
On factors of synchronized sequences
Theoretical Computer Science
On the hybrid Černý-road coloring problem and Hamiltonian paths
DLT'10 Proceedings of the 14th international conference on Developments in language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
The averaging trick and the Černý conjecture
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
Sampling, splitting and merging in coinductive stream calculus
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Root-restricted Kleenean rotations
Information Processing Letters
Varieties of recognizable tree series over fields
Theoretical Computer Science
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
The set of realizations of a max-plus linear sequence is semi-polyhedral
Journal of Computer and System Sciences
Complexity results and the growths of hairpin completions of regular languages
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
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Łukasiewicz logic and weighted logics over MV-semirings
Journal of Automata, Languages and Combinatorics
On computability and some decision problems of parametric weighted finite automata
Journal of Automata, Languages and Combinatorics
A unifying Kleene theorem for weighted finite automata
Rainbow of computer science
Independence of hyperlogarithms over function fields via algebraic combinatorics
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Partial-realization theory for linear switched systems -A formal power series approach
Automatica (Journal of IFAC)
Conjugacy and equivalence of weighted automata and functional transducers
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Complete codes in a sofic shift
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Symbolic and parametric model checking of discrete-time markov chains
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
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
Refinement of near random access video coding with weighted finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Noncommutative rational functions, their difference-differential calculus and realizations
Multidimensional Systems and Signal Processing
Radix cross-sections for length morphisms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
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
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
Note: Marked D0L systems and the 2n-conjecture
Theoretical Computer Science
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
From Glushkov WFAs to \mathbb{K}-Expressions
Fundamenta Informaticae
The Sequence Equivalence Problem for Marked DT0L Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Fundamenta Informaticae
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Partial Conway and Iteration Semirings
Fundamenta Informaticae
On Rational Stochastic Languages
Fundamenta Informaticae
Preferential Regular Path Queries
Fundamenta Informaticae
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
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
Nondeterministic Bimachines and Rational Relations with Finite Codomain
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
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
The removal of weighted ε-transitions
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Stream processing coalgebraically
Science of Computer Programming
Realization theory of discrete-time linear switched systems
Automatica (Journal of IFAC)
Non-commutative arithmetic circuits with division
Proceedings of the 5th conference on Innovations in theoretical computer science
Decision Problems for Probabilistic Finite Automata on Bounded Languages
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.02 |