The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...

Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, andbackward-forwardbisimulations) between fuzzyautomatahavebeen introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of th...

Symbolic finite automata extend classical automata by allowing infinite alphabets given by Boolean algebras and having transitions labeled by predicates over such algebras. Symbolic automata have been intensively studied recently and they have proven useful in several applications. We study some theoretical aspects of symbolic automata. Especially, we study minterms of symbolic automata, that i...

Trauma risk management (TRiM) is an intensive posttraumatic stress disorder (PTSD) psychoeducational management strategy based on peer-group risk assessment developed by the UK Royal Navy (RN). TRiM seeks to modify attitudes about PTSD, stress, and help-seeking and trains military personnel to identify at-risk individuals and refer them for early intervention. This quasiexperimental study found...

We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This directly generalizes the well-studied problem of determining the worst-case state complexity of reversals of ordinary deterministic finite automata. If a DFAO has ...

We show that logical paradoxes based on self-reference (of which the Liar is the best known example) are equivalent to the non-existence of solutions to a numerical system of equations, the so-called truth-value equations. Furthermore, we show that in many cases a self-referential system which does not posses a crisp (Boolean) solution can be solved by expanding the solution set to include fuzz...

Many different deletion operations are investigated applied to languages accepted by one-way and twoway deterministic reversal-bounded multicounter machines, deterministic pushdown automata, and finite automata. Operations studied include the prefix, suffix, infix and outfix operations, as well as left and right quotient with languages from different families. It is often expected that language...

We consider past pushdown timed automata that are discrete pushdown timed automata with past formulas as enabling conditions. Using past formulas allows a past pushdown timed automaton to access the past values of the finite state variables in the automaton. We prove that the reachability (i.e., the set of reachable configurations from an initial configuration) of a past pushdown timed automato...

123 A new method for performing trim optimization of Active Aeroelastic Wing (AAW) technology is presented. The method is based on posing the trim problem as a linear program and solving it with the simplex method. Trim optimization is then integrated with the structural design process in a sequential manner, such that new optimal deflections of the control surfaces are computed for every struc...

This paper addresses the data-ow analysis of access to arrays in recursive imperative programs. When no assumption is made on recursion predicates, only approximate (\fuzzy") ow information can be hoped for in the general case. However, we introduce a new data-ow framework, based on push-down automata and, equivalently, on context-free grammars, and show that this framework allows to describe t...