Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 206 for “"finite state"”.
-
Finite-state binary symmetric channels
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1963.
-
Finite-state control of uncertain systems.
Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
-
Finite-state canonicalization techniques for historical German
… heuristics, canonicalization by weighted finite-state rewrite cascade, and token-wise disambiguation by a dynamic Hidden Markov Model.
-
Loop-free synthesis of finite state machines
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1964.
-
Improving Low-Resource Translation with Finite State Grammars
… using morphological grammars created using finite state transducers. This study explores the benefits, historical background, and effectiveness of this approach. This study incorporates morphological tags into a pre-trained multilingual neural machine translation model using a dual encoder …
-
Finite-State Morphological Parsing Using Register Vector Grammars
Although the RVGMP can parse some data which Kimmo cannot parse, the RVGMP is slower on average than Kimmo. Poor program design is responsible for this slow time. A revised program design, based in part on a new design for RVG, is proposed. Since the redesigned RVGs have doubled their parsing …
-
Finite state analysis with tools for network protocols
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Accelerating Finite State Projection through General Purpose Graphics Processing
The finite state projection algorithm provides modelers a new way of directly solving the chemical master equation. The algorithm utilizes the matrix exponential function, and so the algorithm’s performance suffers when it is applied to large problems. Other work has been done to reduce the size of …
-
Finite state machine representation of digital signal processing systems
… Instead, the filter must be represented as a finite state machine and then implemented using sequential logic circuit synthesis techniques. The logic complexity is found to depend - amongst other considerations - on the so called state (code) assignment. Some preliminary results on this …
-
Source coding for channels with finite-state letter costs
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.
-
Random search of AND-OR graphs representing finite-state models
… concurrent software represented by communicating finite-state machines. But these tools may require a very large amount of memory. A finite-state model can be translated automatically into a compact AND-OR graph. We use an abductive random search scheme to extract, from the AND-OR graph, …
-
A Rigorous Solution for Finite-State Inflow throughout the Flowfield
… inflow model for the entire flow field with finite state method. The derivation is for the case of general skewed angle. The cost of the new method is that one needs to compute the co-states of the inflow equations in the upper hemisphere along with the normal states. Numerical comparisons …
-
Finite-State Genericity : on the Diagonalization Strength of Finite Automata
… der Theorie der Formalen Sprachen: Wir f¨uhren finite-state-Generizit¨atskonzepte ein und verwenden diese, um die Diagonalisierungsst¨arke endlicher Automaten zu erforschen. Wir konzentrieren uns hierbei auf die beschr¨ankte finite-state-Generizit¨at und Spezialf ¨alle hiervon, die wir durch die …
-
Diagnosis of Finite State Models Under Partial or Unreliable Observations
We evaluate the diagnosis performance of the above schemes and explore tradeoffs among observation limitations, communication cost, and memory and processing requirements.
-
Model reduction through an Hankel problem and finite state machines
(cont.) computation required to produce the approximation is O((n2Ì)/[epsilon]) where [epsilon] is the desired â[omega] error and n is the original system order.
-
FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices
… the most prevalent approaches. However, fuzzing Finite State Machines (FSMs) poses a significant challenge due to state and input dependency, resulting in exponential exploration time required to unlock the Finite State Machine. To address this issue, we present a novel approach in this research …
-
Automated test sequence generation for finite state machines using genetic algorithms
… implementations, formally specified using finite state automata (FSA) has been of interest. Such systems include communication protocols and control sections of safety critical systems. There is extensive literature regarding how to formally validate an FSM based specification, but testing …
-
Finite-State Airloads for Deformable Airfoils on Fixed and Rotating Wings
This thesis presents a state-space theory for the lift, drag, and all generalized forces of a deformable airfoil. Trailing-edge flap deflections are included implicitly as a special case of the general deformations. The theory allows for a thin airfoil performing small arbitrary motions with …
-
Comparing 12 finite state models of examinee performance on multiple-choice tests
Finite state test theory models the response behavior of an examinee and establishes the relationship between the ability of the examinee and the observed responses on a multiple-choice test. In finite state modeling, various assumptions about item characteristics and the examinees’ response …
-
Analysis of Finite State Automata and Transducers Processing Acceleration on Disparate Hardware Technologies.
North Carolina State University Theses Electrical and Computer Engineering.
Page 1 of 11