We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
This article contributes a generic model of topic models. To define the problem space, general characteristics for this class of models are derived, which give rise to a represent...
We present our experience in automatically deriving a detailed test case plan exclusively using the UML diagrams developed during the analysis and design phases. We consider in pa...
This paper focuses on the practical value of using and selecting rail simulation models to find real solutions to real problems in constrained traffic corridors. It discusses issu...
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...