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 178 for “"Formal languages"”.
-
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 …
-
Topology, Morphisms, and Randomness in the Space of Formal Languages
… on language spaces. The collection of all languages over a given number of symbols forms a semiring, appropriately termed a language space. Families of languages are defined by interrelations among words. The traditional classification begins with the syntax rules or grammar of the …
-
Forbidding and Enforcing of Formal Languages, Graphs, and Partially Ordered Sets
… conditions. Forbidding and enforcing systems on formal languages were inspired by molecular reactions and DNA computing. Initially, they were used to define new classes of languages (fe-families) based on forbidden subwords and enforced words. This paper considers a metric on languages and proves …
-
Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks
… (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) for the …
-
DNA Computing: Modelling in Formal Languages and Combinatorics on Words, and Complexity Estimation
… processes as computations and by studying formal language and combinatorics on words concepts motivated by DNA processes. It also contributes to the experimental research in DNA computing by a scaling comparison between DNA computing and other models of computation. First, for theoretical …
-
Teaching Formal Languages through Visualizations, Machine Simulations, Auto-Graded Exercises, and Programmed Instruction
The material taught in a Formal Languages course is mathematical in nature and requires students to practice proofs and algorithms to understand the content. Traditional Formal Languages textbooks are heavy on prose, and homework typically consists of solving many paper exercises. Some instructors …
-
The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words
… between the fields of group theory and formal language theory. Given a group with a finite set of generators, it is natural to consider the set of generators and their inverses as an alphabet. We can then consider formal languages such that every group element has at least one …
-
Linguagens lineares fuzzy
Formal languages defined in the late 50’s play an important role in computer science, especially for applications in lexical and syntactic analysis in the construction of compilers and also in grammatical inference techniques. The extended Chomsky hierarchy in addition to “organize” formal …
-
Establishing a Connection Between Graph Structure, Logic, and Language Theory
… interest in the applications of logic and formal languages to graph theory, and a significant amount of work in this field has recently been consolidated in the publication of a book by Courcelle and Engelfriet. We investigate the potential applications of logic and formal languages to the …
-
Webbing reality: essays on the interaction of metaphysics, logic and language
… In Part II, I deal with ontological realism and formal languages, paying particular attention to the formal language of standard first-order predicate logic. Chapters 1 (Salmon’s Modal Paradox), 2 (Solving Salmon’s Modal Paradox) and 3 (The Revenge of Salmon’s Modal Paradox) tackle a modal …
-
Toward an isomorphic diagram of the Backus-Naur form.
Computer scientists studying formal languages have made use of a variety of representations to both reason, and communicate their ideas to others. Symbolic representations have proved useful for rigorously defining the theoretical objects of the preceding topics; however, research shows that …
-
State Complexity of Linear Relations and Linear Subsequences of Automatic Sequences
… we study the state complexity of specific formal languages; for example, we study the number of states required in the minimal automaton reading the representation of two integers $i, j$ in parallel and accepting them if and only $i+c = j$ for some constant integer $c \geq 1$. We also study …
-
Mixing formal specifications using ICL (interconnection language)
… components that are written in different languages and/or run on different kinds of machines. Success largely depends on the ability of their components to communicate and work together despite their differing backgrounds. This thesis addresses the problem of mixing two formal …
-
From requirement document to formal modelling and decomposition of control systems
Formal modelling of control systems can help with identifying missing requirements and design flaws before implementing them. However, modelling using formal languages can be challenging and time consuming. Therefore intermediate steps may be required to simplify the transition from informal …
-
Weighted Automata and Logics on Hierarchical Structures and Graphs
Formal language theory, originally developed to model and study our natural spoken languages, is nowadays also put to use in many other fields. These include, but are not limited to, the definition and visualization of programming languages and the examination and verification of algorithms and …
-
Gramáticas e linguagens indiciais probabilísticas
A new type of grammar for generating formal languages, called indexed gramar, was presented by Alfred V. Aho, in Austin, Texas, 1967. The languages generated by indexed grammars are called indexed languages. The class of languages generated by indexed grammars properly includes a11 context free …
-
Recognizable Languages Defined by Two-dimensional Shift Spaces
… are numerous connections between the theory of formal languages and that of symbolic dynamics. In each, the transition from one dimension to two dimensionsis accompanied by much difficulty due in large part to the emptiness problem, which is related to the presence (or lack thereof) of periodic …
-
Type Systems for Nominal Terms
… for nominal terms, a new syntax, close to<br/>informal practice, for representing and reasoning about formal languages that<br/>use binders.<br/>Nominal techniques allow a rst-order approach to binding in formal languages,<br/>providing direct access to both binders and bound variables and a …
Page 1 of 9