Browsing Waterloo Research by Subject "Upper bound"

Now showing items 1-3 of 3

Cardinality Constrained Robust Optimization Applied to a Class of Interval Observers

McCarthy, Philip James; Nielsen, Christopher; Smith, Stephen L. (IEEE, 2014-07-21)

We propose a linear programming-based method of interval observer design for systems with uncertain but bounded model parameters and initial conditions. We assume that each uncertain parameter in the system model is bounded ...
Syntactic Complexity of Regular Ideals

Brzozowski, Janusz; Szykuła, Marek; Ye, Yuli (Springer, 2017-08-04)

The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic ...
Syntactic Complexity of Suffix-Free Languages

Brzozowski, Janusz; Szykuła, Marek (Elsevier, 2017-09-05)

We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with n left quotients (that is, with state complexity n) is at most (n−1)n−2+n−2 ...