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 29 for “"Formal Languages"”.

  1. Natural language and formal languages

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1997.

    mit Repository record for Natural language and formal languages (opens in a new tab)

  2. Generation and recognition of formal languages.

    Massachusetts Institute of Technology. Dept. of Mathematics. Thesis. 1965. Ph.D.

    mit Repository record for Generation and recognition of formal languages. (opens in a new tab)

  3. 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 …

    vt Repository record for Teaching Formal Languages through Visualizations, Machine Simulations, Auto-Graded Exercises, and Programmed Instruction (opens in a new tab)

  4. 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 …

    brazil-uerj Repository record for Gramáticas e linguagens indiciais probabilísticas (opens in a new tab)

  5. Kleene-Type Results for Weighted Tree-Automata

    … is the generalization of the Kleene-theorem to formal tree-series over commutative semirings (the Kleene theorem states the coincidence between rational and recognizable formal languages). To this end weighted tree-languages are introduced and the Kleene-theorem is proved for them. The desired …

    qucosa-diss

  6. Godel's incompleteness theorems

    … and complete. This thesis will explore two formal languages of logic and their associated mechanically recursive proof methods with the goal of proving Godel's Incompleteness Theorems. This, in combination with an assignment of a natural number to every string of an axiomatic system, will be …

    eastern-wash Repository record for Godel's incompleteness theorems (opens in a new tab)

  7. On labeled paths

    … results examine labeled paths in the context of formal languages beyond the context-free languages. The second result is a lower bound on the length of the longest shortest path when the formal language constraining the path is a member of the control language hierarchy. Finally, the third result …

    alabama Repository record for On labeled paths (opens in a new tab)

  8. Efficient Techniques for Automated Planning for Goals in Linear Temporal Logics on Finite Traces

    … specifications within AI systems using formal languages, especially linear temporal logics. We are interested in efficiently combining temporal logics on finite traces with automated planning, which is an AI model-based approach to producing autonomous behavior and solving the problem of …

    york Repository record for Efficient Techniques for Automated Planning for Goals in Linear Temporal Logics on Finite Traces (opens in a new tab)

  9. Investigations linking the philosophy and psychology of mathematics

    … of representation, e.g. numeral systems or formal languages, good for doing mathematics, by considering how the cognitive system uses such things in the course of doing mathematics.

    uiuc Repository record for Investigations linking the philosophy and psychology of mathematics (opens in a new tab)

  10. Urml: A textual toolkit for teaching model-driven development for reactive systems

    … computer science—from computational models to formal languages. However, even though software designers use formal systems of software, a dominant modelling methodology—model-driven development (MDD)—has not yet penetrated into the industry. This can be attributed to the practitioners’ flawed …

    queens Repository record for Urml: A textual toolkit for teaching model-driven development for reactive systems (opens in a new tab)

  11. Source Code Retrieval using Case Based Reasoning

    Formal verification of source code has been extensively used in the past few years in order to create dependable software systems. However, although formal languages like Spec# or JML are getting more and more popular, the set of verified implementations is very small and only growing slowly. Our …

    maynooth Repository record for Source Code Retrieval using Case Based Reasoning (opens in a new tab)

  12. Optimal planning with temporal logic specifications

    … where the mission specifications are given in formal languages. The problem is posed as a novel variant of the Vehicle Routing Problem (VRP), in which temporal logics and process algebra are utilized to represent a large class of mission specifications in a systematic way. The thesis is …

    mit Repository record for Optimal planning with temporal logic specifications (opens in a new tab)

  13. Detecting Credit-Seeking Behavior on Programmed Instruction Framesets

    … we focus on an eTextbook used for teaching Formal Languages, an advanced computer science course. This eTextbook is using Programmed Instruction (PI) framesets to deliver the material. We take two approaches to analyze session interactions in order to detect credit-seeking incidents. We …

    vt Repository record for Detecting Credit-Seeking Behavior on Programmed Instruction Framesets (opens in a new tab)

  14. Algorithms for autonomous urban navigation with formal specifications

    … satisfy temporal specifications expressed using formal languages. We focus on task specifications that become feasible only if some of the specifications are violated and compute a control law that minimizes the level of unsafety of the system while guaranteeing that it still satisfies the task …

    mit Repository record for Algorithms for autonomous urban navigation with formal specifications (opens in a new tab)

  15. Analyzing Student Session Data in an eTextbook

    … 2020 and Spring 2021 sections of a senior-level Formal Languages course, and also from the Fall 2020 and Spring 2021 sections of a data structures course.

    vt Repository record for Analyzing Student Session Data in an eTextbook (opens in a new tab)

  16. From game comonads to dynamical systems: property-preserving maps as a logical unifying principle

    … hinge on the syntactic properties of formal languages. This interplay frequently manifests through relations between structures, which establish their similarity in various ways and for different purposes. In this work, we focus on three distinct forms of relations between structures: …

    cambridge Repository record for From game comonads to dynamical systems: property-preserving maps as a logical unifying principle (opens in a new tab)

  17. Inference-Time Learning Algorithms of Language Models

    … like linear functions and probabilistic formal languages. I interpret the algorithmic foundations of ICL. First, I prove that Transformer models with sufficient capacity can execute both iterative and closed-form solutions to linear regression problems, and demonstrate that these …

    mit Repository record for Inference-Time Learning Algorithms of Language Models (opens in a new tab)

  18. A framework for sense-making of complex sociotechnical systems

    … many modeling approaches, practices, formal languages and toolsets, to help system architects and engineers with sense-making and decision-making. This work proposes a phenomena-based framework to leverage established modeling practices and guide the selection and composition of …

    mit Repository record for A framework for sense-making of complex sociotechnical systems (opens in a new tab)

  19. Elusive matter, material bodies: American art in the age of electronic mediation, 1865-1918

    … period adapted new communicative strategies and formal languages to traditional materials and modes of creative expression—from landscape and genre paintings to quilts and decorative desk sets—to help translate this elusive process into material form. By approaching these practices as both …

    uiuc Repository record for Elusive matter, material bodies: American art in the age of electronic mediation, 1865-1918 (opens in a new tab)

  20. Exact Solution of Bayes and Minimax Change-Detection Problems

    … are described and analyzed. Simple classes of formal languages are shown to be sufficient for epsilon-exact solution of change-detection problems, and methods for finding minimally sized policy representations are described.

    uiuc Repository record for Exact Solution of Bayes and Minimax Change-Detection Problems (opens in a new tab)

Page 1 of 2