In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite state automata and transducers. Traditional methods consist of two steps. The first one is to construct atrie, the second one -to perform minimization. Our approach is to construct an automaton in a single step by adding new strings one by one and minimizing the resulting automaton on-the-fly. We pre...

In this paper we consider controllable behaviors over Zpr that admit an image representation which has a Laurent polynomial left inverse. We solve the problem of determining a minimal state diagram representation for such behaviors. Using the concept of p-basis for submodules of Zpr [z], that was introduced in (Kuijper et al., 2007), we define an expanded type of image representations for the g...

We find a minimal set of necessary and sufficient conditions for the existence of a local procedure that converts a finite pure state into one of a set of possible final states. This result provides a powerful method for obtaining optimal local entanglement manipulation protocols for pure initial states. As an example, we determine analytically the optimal distillable entanglement for arbitrary...

Today statecharts are a de facto standard in industry for modeling system behavior. Test data generation is one of the key issues in software testing. This paper proposes an reduction approach to test data generation for the state-based software testing. In this paper, first state transition graph is derived from state chart diagram. Then, all the required information are extracted from the sta...

Daciuk et al. [Computational Linguistics 26(1):3–16 (2000)] describe a method for constructing incrementally minimal, deterministic, acyclic finite-state automata (dictionaries) from sets of strings. But acyclic finite-state automata have limitations: For instance, if one wants a linguistic application to accept all possible integer numbers or Internet addresses, the corresponding finitestate a...

We give a survey of the results in connection with the minimal state space realization problem for linear time-invariant systems. We start with a brief historical overview and a short introduction to linear system theory. Next we present some of the basic algorithms for the reduction of non-minimal state space realizations and for the minimal state space realization of infinite or finite sequen...

After nearly a century of expansion, the role of government has contracted, at least in qualitative terms, over the past twenty years. The assumption that this is a natural and inevitable trend is mistaken. The success of the 'mixed economy' in the period from 1945 to 1970, and the limited benefits generated so far by reforms aimed at a contraction of the role of government, suggest that radica...

We present two solutions to the firing synchronization problem on the ring, an 8-state minimal-time solution and a 6-state non-minimaltime solution. Both solutions use fewer states than the previous bestknown minimal-time automaton, a 16-state solution due to Culik. We also give the first lower bounds on the number of states needed for solutions to the ring firing synchronization problem. We sh...