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 56 for “"Formal Language"”.

  1. Experimental and Formal Language Design Applied to Control Constructs for Interactive Computing

    Made available in DSpace on 2014-12-13T18:01:51Z (GMT). No. of bitstreams: 1 7708984.pdf: 4129893 bytes, checksum: 8a8fcf104e231389c4841c3939043a16 (MD5) Previous issue date: 1976

    uiuc Repository record for Experimental and Formal Language Design Applied to Control Constructs for Interactive Computing (opens in a new tab)

  2. First order logic as a formal language : an investigation of categorial grammar.

    Thesis. 1976. Ph.D.--Massachusetts Institute of Technology. Dept. of Philosophy.

    mit Repository record for First order logic as a formal language : an investigation of categorial grammar. (opens in a new tab)

  3. Framework for Automatic Translation of Hardware Specifications Written in English to a Formal Language

    … of hardware specifications from natural language to assertions in a formal representation has the potential to improve the verification productivity of ICs. However, natural language specifications have the characteristics of being imprecise, incomplete, and ambiguous. An automation …

    vt Repository record for Framework for Automatic Translation of Hardware Specifications Written in English to a Formal Language (opens in a new tab)

  4. Combinatorics of a family of stochastic differential equations with an eye towards topological temperature

    … equations is achieved using combinatorics and formal language theory. This is extended to a topological notion of temperature and qualitative results regarding the relatedness of scale separated stochastic dynamical systems by changes in temperature.

    uiuc Repository record for Combinatorics of a family of stochastic differential equations with an eye towards topological temperature (opens in a new tab)

  5. Aspectos sequenciais da decodificação sintática

    … syntactical information of the sentences of a formal language in their decoding, after they have passed through a noisy channel. Fano's algorithm for sequential decoding is adapted to syntactical decoding. The algorithm is simulated in the IBM 370 for three diferent sources and channels. The …

    brazil-uerj Repository record for Aspectos sequenciais da decodificação sintática (opens in a new tab)

  6. Groups and Simple Languages

    … (pi) = of a group G, one can associate a formal language WP(,0)((pi)), the reduced word problem of (pi), consisting of all words on the generators and their inverses which are equal to the identity of G but have no proper prefix equal to the identity. A general problem, then, is to …

    uiuc Repository record for Groups and Simple Languages (opens in a new tab)

  7. Bilingualism and educational achievement:a study of young bilinguals in Birmingham schools and colleges

    … aimed firstly to investigate current patterns of language use amongst young bilinguals in Birmingham and secondly to examine the relationship between this language use and educational achievement. The research then focussed on various practices, customs and attitudes which would favour the …

    aston Repository record for Bilingualism and educational achievement:a study of young bilinguals in Birmingham schools and colleges (opens in a new tab)

  8. Translating timed I/O automata specifications for theorem proving in PVs

    … based description has to be translated to the language of the theorem prover. This thesis describes a tool for translating from TIOA, the formal language for describing timed input/output automata, to the language of the Prototype Verification System (PVS)--a specification system with an …

    mit Repository record for Translating timed I/O automata specifications for theorem proving in PVs (opens in a new tab)

  9. Cherokee Abstract Artist Leon Polk Smith: A Convergence of Traditions

    … it is revealed how Polk Smith developed a formal language that could navigate both worlds and be viewed through a pure abstraction lens or a lens embodying his Indigenous traditions. In addition to his Indigenous philosophies, Mesoamerican Inca Nation’s cultural motifs further ground Polk …

    cuny Repository record for Cherokee Abstract Artist Leon Polk Smith: A Convergence of Traditions (opens in a new tab)

  10. Felt/felt

    … The geometries that arise have a certain minimal formal austerity while embracing felts subtle yet irrepressible unruliness. There is a conversation between material, form, and experience in each of these sculptures. This paper fleshes out the significance of materiality, formal language, …

    york Repository record for Felt/felt (opens in a new tab)

  11. 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)

  12. From concord to lexicon : development and test of a corpus-based lexical tutor

    … described as the future of computer assisted language learning, but first there are two problems. Its benefits have been hard to validate empirically, and it is conceived for advanced learners while the majority receiving formal language instruction are intermediate. This study describes the …

    concordia Repository record for From concord to lexicon : development and test of a corpus-based lexical tutor (opens in a new tab)

  13. Integrating human-provided information into belief state representation using dynamic factorization

    … declarative information presented in a formal language. Computational efficiency is achieved by dynamically selecting an appropriate factoring of the belief state, combining aspects of the belief when they are correlated through information and separating them when they are not. This …

    mit Repository record for Integrating human-provided information into belief state representation using dynamic factorization (opens in a new tab)

  14. QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES

    … power, with particular emphasis on unary language recognition. Frameworks for recognising unary languages by Latvian QFAs (LQFAs) and QFAs with Control Language (QFCs) are developed. Moreover, decidability questions related to periodicity in measure-once QFAs, measure-many QFAs, LQFAs, and …

    milano Repository record for QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES (opens in a new tab)

  15. Simulation of timed input/output automata

    … Automaton framework, and supports TIOA, a formal language for specifying timed I/O automata. Simulation of TIOA programs is useful in the process of testing the proposed system over a specific set of executions. During the execution the Simulator is able to test proposed invariants and …

    mit Repository record for Simulation of timed input/output automata (opens in a new tab)

  16. Discrete event system modeling using SysML and model transformation

    … event logistics systems (DELS) by using a formal language, the System Modeling Language (SysML), for conceptual modeling and a corresponding methodology for translating the conceptual model into a simulation model. There are three parts in this research: plant modeling, control modeling, …

    gatech Repository record for Discrete event system modeling using SysML and model transformation (opens in a new tab)

  17. Symbolic semantics for CSP

    … Sequential Processes (CSP) is a well-known formal language for describing concurrent systems, for which a transition semantics has been given by Brookes, Hoare and Roscoe. In this thesis, we present a generalized transition semantics of CSP, which we call HCSP, that merges the original …

    uiuc Repository record for Symbolic semantics for CSP (opens in a new tab)

  18. Towards an automatic predictive question formulation

    In this thesis, we designed a formal language, called Trane, for describing prediction problems over relational datasets, implemented a system that allows humans to specify problems in that language, and allows them to build models that solve them using real data. We show that this language is able …

    mit Repository record for Towards an automatic predictive question formulation (opens in a new tab)

  19. Goal and Preference Identification in Natural Language Expressions

    … goals and preferences need to be specified in a formal language, making automated processing inaccessible to the very bearers of goals and preferences, i.e., the stakeholders. We combine natural language processing techniques to allow specification of preferences through natural language

    york Repository record for Goal and Preference Identification in Natural Language Expressions (opens in a new tab)

Page 1 of 3