175 research outputs found
Time and tape complexity of pushdown automaton languages
An algorithm is presented which will determine whether any string w in Σ*, of length n, is contained in a language L ⊆ Σ* defined by a two-way nondeterministic pushdown automation. This algorithm requires time n3 when implemented on a random access computer. It requires n4 time and n2 tape when implemented on a multitape Turing machine.If the pushdown automaton is deterministic, the algorithm requires n2 time on a random access computer and n2 log n time on a multitape Turing machine
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality
International audienceWe present an algorithm for constructing the minimal automaton recognizing A∗X, where the pattern X is a set of m (that is a fixed integer) non-empty words over a finite alphabet A whose sum of lengths is n. This algorithm, inspired by Brzozowski's minimization algorithm, uses sparse lists to achieve a linear time complexity with respect to n
Decision Problems For Convex Languages
In this paper we examine decision problems associated with various classes of
convex languages, studied by Ang and Brzozowski (under the name "continuous
languages"). We show that we can decide whether a given language L is prefix-,
suffix-, factor-, or subword-convex in polynomial time if L is represented by a
DFA, but that the problem is PSPACE-hard if L is represented by an NFA. In the
case that a regular language is not convex, we prove tight upper bounds on the
length of the shortest words demonstrating this fact, in terms of the number of
states of an accepting DFA. Similar results are proved for some subclasses of
convex languages: the prefix-, suffix-, factor-, and subword-closed languages,
and the prefix-, suffix-, factor-, and subword-free languages.Comment: preliminary version. This version corrected one typo in Section
2.1.1, line
The role of culture and society in the development of plot in tanushree podders escape from harem and gita mehtas a river sutra: a feminist reading
Culture and Society are often the main gist of most novels. These two factors often influence and control the characters, thus helping in the development of the plot. A plot, as defined by Egan (1978), is used to indicate an outline of events and serves as a skeleton in a literary piece. In other words, it is a tool in making sure the main incidents or scenarios are presented in a particular order to establish a clear understanding of what is being written. Culture and society plays the essence in a novel as it constructs these main ideas in engaging the interest of a reader and also extends the intended message of the particular writer. This paper looks into how culture and society helps in developing the plots of the selected novels using the feminist approach. Tanushree Podder’s, Escape from Harem (2013) and Gita Mehta’s A River Sutra (1993) amazingly are both set in India. Podder and Mehta have inserted the perception society had over women and how male supremacy was glorified in many aspects. The essence of feminist approach was very much present in these two novels. According to Tyson (2006), feminism concerns the ways in which literature undermines the economic, political, social and psychological oppression on women. Though the setting of both novels fall in different eras but the theme of female oppression remains the same. The patriarchal society uses culture and religion as a tool to control women and oppress them. Both authors have shown how the women in the 17th century and in the 20th century face the same kind of judgment from the society and men in general
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states than M. There has been much interest in the automated generation of a short checking sequence from a finite state machine. However, such sequences can contain reset transitions whose use can adversely affect both the cost of applying the checking sequence and the effectiveness of the checking sequence. Thus, we sometimes want a checking sequence with a minimum number of reset transitions rather than a shortest checking sequence. This paper describes a new algorithm for generating a checking sequence, based on a distinguishing sequence, that minimises the number of reset transitions used.This work was supported in part by Leverhulme Trust grant number F/00275/D, Testing State Based Systems, Natural Sciences and Engineering Research Council (NSERC) of Canada grant number RGPIN 976, and Engineering and Physical Sciences Research Council grant number GR/R43150, Formal Methods and Testing (FORTEST)
Policy-Driven Memory Protection for Reconfigurable Hardware
Abstract. While processor based systems often enforce memory pro-tection to prevent the unintended sharing of data between processes, current systems built around reconfigurable hardware typically offer no such protection. Several reconfigurable cores are often integrated onto a single chip where they share external resources such as memory. While this enables small form factor and low cost designs, it opens up the op-portunity for modules to intercept or even interfere with the operation of one another. We investigate the design and synthesis of a memory protection mechanism capable of enforcing policies expressed as a formal language. Our approach includes a specialized compiler that translates a policy of legal sharing to reconfigurable logic blocks which can be di-rectly transferred to an FPGA. The efficiency of our access language design flow is evaluated in terms of area and cycle time across a variety of security scenarios
Translating Message Sequence Charts to other Process Languages Using Process Mining
Message Sequence Charts (MSCs) are often used by software analysts when discussing the behavior of a system with different stakeholders. Often such discussions lead to more complete behavioral models in the form of, e.g., Event-driven Process Chains (EPCs), Unified Modeling Language (UML), activity diagrams, Business Process Modeling Notation (BPMN) models, Petri nets, etc. Process mining on the other hand, deals with the problem of constructing complete behavioral models by analyzing event logs of information systems. In contrast to existing process mining techniques, where logs are assumed to only contain implicit information, the approach presented in this paper combines the explicit knowledge captured in individual MSCs and the techniques and tools available in the process mining domain. This combination allows us to discover high-quality process models. To constructively add to the existing work on process mining, our approach has been implemented in the process mining framework ProM (www.processmining.org)
Velocity-space sensitivity of the time-of-flight neutron spectrometer at JET
The velocity-space sensitivities of fast-ion diagnostics are often described by so-called weight functions. Recently, we formulated weight functions showing the velocity-space sensitivity of the often dominant beam-target part of neutron energy spectra. These weight functions for neutron emission spectrometry (NES) are independent of the particular NES diagnostic. Here we apply these NES weight functions to the time-of-flight spectrometer TOFOR at JET. By taking the instrumental response function of TOFOR into account, we calculate time-of-flight NES weight functions that enable us to directly determine the velocity-space sensitivity of a given part of a measured time-of-flight spectrum from TOFOR
On the mechanisms governing gas penetration into a tokamak plasma during a massive gas injection
A new 1D radial fluid code, IMAGINE, is used to simulate the penetration of gas into a tokamak plasma during a massive gas injection (MGI). The main result is that the gas is in general strongly braked as it reaches the plasma, due to mechanisms related to charge exchange and (to a smaller extent) recombination. As a result, only a fraction of the gas penetrates into the plasma. Also, a shock wave is created in the gas which propagates away from the plasma, braking and compressing the incoming gas. Simulation results are quantitatively consistent, at least in terms of orders of magnitude, with experimental data for a D 2 MGI into a JET Ohmic plasma. Simulations of MGI into the background plasma surrounding a runaway electron beam show that if the background electron density is too high, the gas may not penetrate, suggesting a possible explanation for the recent results of Reux et al in JET (2015 Nucl. Fusion 55 093013)
Relationship of edge localized mode burst times with divertor flux loop signal phase in JET
A phase relationship is identified between sequential edge localized modes (ELMs) occurrence times in a set of H-mode tokamak plasmas to the voltage measured in full flux azimuthal loops in the divertor region. We focus on plasmas in the Joint European Torus where a steady H-mode is sustained over several seconds, during which ELMs are observed in the Be II emission at the divertor. The ELMs analysed arise from intrinsic ELMing, in that there is no deliberate intent to control the ELMing process by external means. We use ELM timings derived from the Be II signal to perform direct time domain analysis of the full flux loop VLD2 and VLD3 signals, which provide a high cadence global measurement proportional to the voltage induced by changes in poloidal magnetic flux. Specifically, we examine how the time interval between pairs of successive ELMs is linked to the time-evolving phase of the full flux loop signals. Each ELM produces a clear early pulse in the full flux loop signals, whose peak time is used to condition our analysis. The arrival time of the following ELM, relative to this pulse, is found to fall into one of two categories: (i) prompt ELMs, which are directly paced by the initial response seen in the flux loop signals; and (ii) all other ELMs, which occur after the initial response of the full flux loop signals has decayed in amplitude. The times at which ELMs in category (ii) occur, relative to the first ELM of the pair, are clustered at times when the instantaneous phase of the full flux loop signal is close to its value at the time of the first ELM
- …