We give characterizations of strong determinism for regular expressions with counting, based on which we present an O(|ΣE ||E|) time algorithm to check whether an expression E with counting is strongly deterministic where ΣE is the set of distinct symbols in E. It improves the previous upper bound of O(|E|) time on the same decision problems for both standard regular expressions and regular exp...

This paper discusses a deterministic version of #-rewriting systems with context-free rules. It demonstrates that classical form of determinism does not affect the generative power of #rewriting systems. The result concerning deterministic #-rewriting systems of index k is given too. The conclusion discusses even the stronger type of determinism.

The main concern of this paper is the study of the interplay between functionality and non determinism. Indeed the rst question we ask is whether the analysis of parallelism in terms of sequentiality and non determinism, which is usual in the algebraic treatment of concurrency, remains correct in presence of functional application and abstraction. We identify non determinism in the setting of -...