Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructing Finite Maximal Codes from Schützenberger Conjecture
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Scheduling hard sporadic tasks with regular languages and generating functions
Theoretical Computer Science - Implementation and application automata
Journal of Automata, Languages and Combinatorics
Connections between subwords and certain matrix mappings
Theoretical Computer Science - The art of theory
*-μ-Semirings and *-μ-lamda;-semirings
Theoretical Computer Science
Independence of certain quantities indicating subword occurrences
Theoretical Computer Science
Subword conditions and subword histories
Information and Computation
On the context-freeness of the set of words containing overlaps
Information Processing Letters
Kleene theorems for skew formal power series
Acta Cybernetica
Skew and infinitary formal power series
Theoretical Computer Science
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Weighted automata with discounting
Information Processing Letters
Subword histories and associated matrices
Theoretical Computer Science
Optimality Theory and Vector Semirings
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Cycle-Free Finite Automata in Partial Iterative Semirings
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science
Selected operations and applications of n-tape weighted finite-state machines
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Joining composition and trimming of finite-state transducers
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Large-scale training of SVMs with automata kernels
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
(α,β)-intuitionistic fuzzy ideals of hemirings
Computers & Mathematics with Applications
Efficient matrix-encoded grammars and low latency parallelization strategies for CYK
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Characterization Results for Time-Varying Codes
Fundamenta Informaticae
Realization theory of discrete-time linear switched systems
Automatica (Journal of IFAC)
| Hi-index | 0.01 |