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 44 for “"regular language"”.
-
Reconstructing Signaling Pathways Using Regular-Language Constrained Paths
… The key idea underlying RegLinker is the use of regular-language constraints to control the number of non-pathway edges present in the computed paths. We systematically evaluate RegLinker and alternative approaches against a comprehensive set of 15 signaling pathways and demonstrate that …
-
Problems Related to Shortest Strings in Formal Languages
In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for other problems involving languages. For example, the length of the shortest …
-
Automata and Ratio Sets
… if the comprising sets of natural numbers are a regular language when represented in a given base. I also present an algorithm for deciding the inclusion of a rational number in the ratio set of a few select sets of natural numbers that are not a regular language when represented in any base, …
-
Distances Between Languages: Algorithms and Descriptional Complexity
… descriptional complexity of neighbourhoods of regular languages and the computational complexity of computing the distance between languages. Distance measures are defined on words to describe their similarity. These measures can be extended to languages, which are sets of words. We consider …
-
Identification of reading disabilities in Spanish : an English-Spanish comparison
… of reading disabilities in Spanish, a regular language as compared to English, an irregular language. In study one, a sample of 66 Spanish-speaking children was compared with two English samples on a language equivalent measure of word and nonword decoding. Also, a discrepancy score …
-
Mokinių, turinčių kalbėjimo ir kalbos sutrikimų, patiriamos patyčios /
… also explored if students that have disorders of language and speaking attain more taunting. There is formulated a hypothesis that disorder of language and speaking is not the main reason of taunting that students experience. There participated a hundred respondents that have language and speaking …
-
Inducing Grammar from Sparse Data Sets
… proposes new tools and methods for identifying a regular language based on a finite set of example strings. There have been a number of different approaches proposed for grammar induction. Current state-of-the-art solutions leverage a depth-first search strategy, which is an evidence based state …
-
A correspondence principle for finite state dimension
… dimension. We prove that any [omega]-regular language (i.e., set of binary sequences accepted by a Buchi automaton) satisfies the correspondence principle.</p>
-
Cusp Pattern Enumeration and Completion Search for Mixed-Platonic 3-Manifold
… 3-manifold ad-mitting a cellulation by regular ideal tetrahedra and regular ideal octahedra [4]. We develop a completion search algorithm that, given a candidate cusp cellulation, determines all compatible mixed-platonic cellulations by assigning embeddings to cusp cells via backtracking …
-
Beyond Hyperbolicity: Generalizing Classical Results from Hyperbolic Groups to all Finitely Generated Groups
… We show that for any generating set A, the language consisting of all geodesics in Cay(G, A) with a contracting property is a regular language. As an application, we show that any finitely generated group containing an infinite contracting geodesic must be either virtually Z or …
-
Monoids and the State Complexity of the Operation root(<i>L</i>)
… complexity of some different representations of regular languages. As well, we consider the state complexity of the operation root(<i>L</i>). We give quick treatment of the deterministic state complexity bounds for nondeterministic finite automata and regular expressions. This includes an …
-
Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks
… network (RNN) uses while learning to recognize a regular formal language. Specially, we train a RNN on positive and negative examples from a regular language, and ask if there is a simple decoding function that maps states of this RNN to states of the minimal deterministic fnite automaton (MDFA) …
-
Left Quotients by Regular Languages
In formal language theory, the operation of left quotient plays a foundational role, especially in the study of regular languages. This thesis studies the operation of left quotient by a regular language on several language families, in particular those accepted by deterministic classes of automata …
-
Quasi-Isometric Graph Simplification and Graph Centrality
… of balanced partition-paths, and establish regular-language characterisations of the possible outcomes of two probabilistic path-partitioning algorithms.
-
Syntactic Complexities of Nine Subclasses of Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We …
-
Binomial Coefficients of Words and Multidimensional Arrays: Geometry, Complexity, and Reconstruction
… any cofinal quadrant. In a fixed component of a regular language of polynomial growth, binomial queries are polynomials in the loop exponents. We solve reconstruction for reduced two-loop presentations and give, for any number of loops, a decidable sufficient condition by quantifier elimination …
-
Shifted Eisenstein polynomials, irreducible compositions of polynomials and group key exchanges
… irreducible compositions have the structure of a regular language. In the final chapter, we study cryptographic protocols for key exchange in ad-hoc groups. We first translate some protocols from the literature to the more general setting of semigroup actions, and then propose our own variants of …
-
Symbolic techniques for parameterised verification
… automata-based symbolic model checking (a.k.a. regular model checking) as a generic formalism for parameterised systems. Although this formalism is Turing powerful (i.e. it can simulate the computation of Turing machines), the nice closure and algorithmic properties of finite automata still …
-
Linear Types, Protocols, and Processes in Classical F°
… The complexity budgets of most programming languages, however, do not allow for new forms of types aimed at specific problem domains--even domains as broad as these. Classical F◦ --read "F-pop"--is a typed λ-calculus based on classical (i.e., full) linear logic, wherein session types arise …
-
A Study of Remediation of Language Arts Objectives Using an Experimental Curriculum
… was to determine if students who participated in language arts remediation which was infused with critical thinking activities and metacognition would make greater gains in skills and achievement than those students who were remediated with a regular language arts curriculum. The population for …
Page 1 of 3