Canonizable Partial Order Generators

Cantor Topologies for Finite Words

Capacity Bounded Grammars and Petri Nets

Ciliate Gene Unscrambling with Fewer Templates

Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages

Circular words and applications

Combinatorial Characterization of Formal Languages

Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions

Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms

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