Complete Context Calculus Design and Implementation in GIPSY
Complexity in Prefix-Free Regular Languages
Complexity of Problems for Commutative Grammars
Compositional closure for Bayes Risk in probabilistic noninterference
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)
Computational Aspects of Asynchronous CA
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Computing Distances between Probabilistic Automata
Constructing Premaximal Binary Cube-free Words of Any Level
Construction of fuzzy automata from fuzzy regular expressions
Construction of minimal DFAs from biological motifs
Context-free ordinals
Coordinates for a new triangular tiling of the hyperbolic plane
Decidability and Shortest Strings in Formal Languages
Decidability of the Equivalence of Multi-Letter Quantum Finite Automata
Decidable Problems for Probabilistic Automata on Infinite Words
Deciding if a Regular Language is Generated by a Splicing System
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
Deciding the Value 1 Problem of Probabilistic Leaktight Automata
Decomposition Complexity