scholarly journals A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata

Entropy ◽  
2019 ◽  
Vol 21 (9) ◽  
pp. 903
Author(s):  
Guangjian Huang ◽  
Shahbaz Hassan Wasti ◽  
Lina Wei ◽  
Yuncheng Jiang
Keyword(s):  
Theoretical Approach ◽  
Weather Forecasting ◽  
Formal Model ◽  
Finite Automata ◽  
Formal Theory ◽  
Theory Of Computation ◽  
Probabilistic Automata ◽  
Semantic Reasoning ◽  
Input Alphabet ◽  
Semantic Computing

In most previous research, “semantic computing” refers to computational implementations of semantic reasoning. It lacks support from the formal theory of computation. To provide solid foundations for semantic computing, researchers propose a different understanding of semantic computing based on finite automata. This approach provides a computer theoretical approach to semantic computing. But finite automata are not capable enough to deal with imprecise knowledge. Therefore, in this paper, we provide foundations for semantic computing based on probabilistic automata. Even though traditional probabilistic automata can handle imprecise knowledge, their limitation resides in their being defined on a fixed finite input alphabet. This deeply restricts the abilities of automata. In this paper, we rebuild traditional probabilistic automata for semantic computing. Furthermore, our new probabilistic automata are robust enough to handle any alphabet as input. They have better performances in many applications. We provide an application for weather forecasting, a domain for which traditional probabilistic automata are not effective due to their finite input alphabet. Our new probabilistic automata can overcome these limitations.

A formal model of semantic computing

2018 ◽  
Vol 23 (14) ◽  
pp. 5411-5429 ◽  
Author(s):  
Yuncheng Jiang
Keyword(s):  
Formal Model ◽  
Semantic Computing

DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET

2008 ◽  
Vol 19 (03) ◽  
pp. 617-631 ◽  
Author(s):  
JOZEF JIRÁSEK ◽  
GALINA JIRÁSKOVÁ ◽  
ALEXANDER SZABARI
Keyword(s):  
Finite Automaton ◽  
Finite Automata ◽  
Magic Numbers ◽  
Deterministic Finite Automaton ◽  
Nondeterministic Finite Automata ◽  
Letter Alphabet ◽  
Input Alphabet ◽  
Nondeterministic Finite Automaton

We show that for all integers n and α such that n ⩽ α ⩽ 2n, there exists a minimal nondeterministic finite automaton of n states with a four-letter input alphabet whose equivalent minimal deterministic finite automaton has exactly α states. It follows that in the case of a four-letter alphabet, there are no "magic numbers", i.e., the holes in the hierarchy. This improves a similar result obtained by Geffert for a growing alphabet of size n + 2.

scholarly journals Learning TOC - Begins

2018 ◽  
pp. 255-260
Author(s):  
Vishal Prajapati ◽  
Shivani Champaneri ◽  
Rahul Dhamecha ◽  
Janvi Sindha ◽  
Dr. Sheshang Degadwala
Keyword(s):  
Computer Science ◽  
Web Application ◽  
Regular Expression ◽  
Finite Automata ◽  
Theory Of Computation ◽  
Science Field ◽  
Context Free Grammar ◽  
Fundamental Reason ◽  
Push Down ◽  
Context Free

Learning TOC – begins is a web application which is useful for Learning TOC (Theory of Computation). It covers hypothesis of the basic points with cases and it likewise has Exercise segment in which client can check different speculations for all intents and purposes. It likewise creates drawing of different cases. So the client can learn it adequately and additionally quick. Client can build FA of the string without anyone else and print or fare it for his task work. It has the office of Test to check his score and readiness work. So it is extremely valuable for client as exam arrangement. This Web Application is valuable for the educators and understudies and additionally different clients which are has a place with the Computer Science field. The fundamental reason for this web application is to pick up everything outwardly and graphically. It covers the listed topics given below- Regular Expression, Finite Automata, Context Free Grammar, Push Down Automata, Turing Machine, Exercise of the topics, Mock test.

scholarly journals In the Body’s Eye: The Computational Anatomy of Interoceptive Inference

2019 ◽  
Author(s):  
Micah Allen ◽  
Andrew Levy ◽  
Thomas Parr ◽  
Karl J. Friston
Keyword(s):  
Heart Rate ◽  
Heart Rate Variability ◽  
Cardiac Cycle ◽  
Formal Model ◽  
Rhythmic Activity ◽  
Formal Theory ◽  
Physiological Reactivity ◽  
Prediction Errors ◽  
Active Inference ◽  
Growing Body

AbstractA growing body of evidence highlights the intricate linkage of exteroceptive perception to the rhythmic activity of the visceral body. In parallel, interoceptive inference theories of emotion and self-consciousness are on the rise in cognitive science. However, thus far no formal theory has emerged to integrate these twin domains; instead most extant work is conceptual in nature. Here, we introduce a formal model of cardiac active inference, which explains how ascending cardiac signals entrain exteroceptive sensory perception and confidence. Through simulated psychophysics, we reproduce the defensive startle reflex and commonly reported effects linking the cardiac cycle to fear perception. We further show that simulated ‘interoceptive lesions’ blunt fear expectations, induce psychosomatic hallucinations, and exacerbate metacognitive biases. Through synthetic heart-rate variability analyses, we illustrate how the balance of arousal-priors and visceral prediction errors produces idiosyncratic patterns of physiological reactivity. Our model thus offers the possibility to computationally phenotype disordered brain-body interaction.

scholarly journals On the problem of computer processing of natural language texts

2020 ◽  
Vol 7 (1) ◽  
pp. 37-45
Author(s):  
A.V. Palagin ◽  
◽  
M.G. Petrenko ◽  
D.G. Zelentsov ◽  
◽  
...  
Keyword(s):  
Information System ◽  
Natural Language ◽  
Information Technologies ◽  
System Analysis ◽  
Formal Model ◽  
Formal Theory ◽  
Computer Processing ◽  
Natural Language Text ◽  
Linguistic Model ◽  
Tech Nologies

The present paper deals with the general approach to the problem of analyzing natural language information, including the implementation of a number of information technologies related in one way or another to language modeling. In addition to the development of the aforementioned tech-nologies, it is necessary to develop a formal theory of computer processing of knowledge extracted from natural language texts. The specific features of constructing linguistic models and the criteria for understanding natural language texts are analyzed. This raises a number of problems. The first problem comes down to the problem of analyzing textual information presented in natural language (morphological, syntactic, semantic and logical analysis) in order to extract knowledge. The second problem is associated with designing a system for searching, processing and extracting knowledge, developing and constructing its architecture, as well as tools for the user. The third problem is the development of procedures for the integration of knowledge from several subject areas to ensure the effectiveness of conducting studies of an interdisciplinary and transdisciplinary nature. It is also necessary to pay special attention to the use of already developed theoretical prin-ciples and practical solutions. A formal statement of the problem of the analysis of natural language texts is proposed, in which the main subtasks are identified, associated with the calculation of typ-ing relationships of vocabulary of a natural language on a lexico-semantic continuum and the inter-pretation of some text on a given subject model. In the context of the developed architecture of the linguistic-ontological information system, a formal model for processing natural-language texts is proposed, for which an unambiguous correspondence of the processes of processing natural-language information and means (architectural blocks) of their implementation is shown. Keywords: ELRE natural language text, linguistic model, language ontological information system, analysis and understanding of natural language texts.

Candidate Motivation: A Synthesis of Alternative Theories

1983 ◽  
Vol 77 (1) ◽  
pp. 142-157 ◽  
Author(s):  
Donald Wittman
Keyword(s):  
Theoretical Model ◽  
Empirical Research ◽  
Formal Model ◽  
Formal Theory ◽  
Comparative Statics ◽  
Electoral Behavior ◽  
Type Model ◽  
Per Se ◽  
Alternative Theories ◽  
Issue Space

A formal model of electoral behavior is developed under the assumption that candidates have policy preferences as well as an interest in winning per se. This model is shown to have an equilibrium in a k-issue space when there are two candidates. The implications of this model are compared to the implications of the Downsian-type model where candidates are interested only in winning. Testable propositions are derived via the use of comparative statics. The results of recent studies are shown to coincide with the synthesis model but not the pure Downsian model.The theoretical model bridges the gap between formal theory and empirical research and unifies a variety of seemingly unrelated studies.

NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA

2008 ◽  
Vol 19 (03) ◽  
pp. 565-580 ◽  
Author(s):  
RŪSIŅŠ FREIVALDS
Keyword(s):  
Number Theory ◽  
Finite Automata ◽  
Explicit Description ◽  
Probabilistic Automata ◽  
Deterministic Automaton ◽  
Cut Point ◽  
Constructive Methods ◽  
Artin's Conjecture ◽  
Quantum Finite Automata

Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. However, the proof is non-constructive. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures not proved but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.

Differential polarization imaging of sickled cells

1988 ◽  
Vol 46 ◽  
pp. 62-63
Author(s):  
Marcos F. Maestre
Keyword(s):  
Optical Properties ◽  
Theoretical Approach ◽  
Polarized Light ◽  
Polarization Microscopy ◽  
Spectroscopic Techniques ◽  
Polarization Imaging ◽  
Circularly Polarized Light ◽  
Circularly Polarized ◽  
Microscopic Scale ◽  
Chiral Structures

Recently we have developed a form of polarization microscopy that forms images using optical properties that have previously been limited to macroscopic samples. This has given us a new window into the distribution of structure on a microscopic scale. We have coined the name differential polarization microscopy to identify the images obtained that are due to certain polarization dependent effects. Differential polarization microscopy has its origins in various spectroscopic techniques that have been used to study longer range structures in solution as well as solids. The differential scattering of circularly polarized light has been shown to be dependent on the long range chiral order, both theoretically and experimentally. The same theoretical approach was used to show that images due to differential scattering of circularly polarized light will give images dependent on chiral structures. With large helices (greater than the wavelength of light) the pitch and radius of the helix could be measured directly from these images.

Sign in / Sign up

Export Citation Format

Share Document