Search

Temporal Logics are a rich variety of logical systems designed for specifying properties over time, and about events and changes in the world over time. Traditional temporal logic, however, is limited to binary outcomes true or false and lacks the capacity to specify performance properties of a system such as the maximum, minimum, or average costs between states. Current languages do not accommodate the quantification of such performance properties, especially in scenarios involving infinite execution paths where performance property like cumulative sums may fail to converge. To this end, this paper introduces a novel formal language aimed at assessing system performance, which encapsulates not only temporal dynamics but also various performance-related properties. In this study, this paper utilizes reinforcement learning techniques to compute the values of performance property formulas. Finally, in the experimental part, a formal language representation of system performance properties was implemented, and the values of the performance property formulas were computed using reinforcement learning. The effectiveness and feasibility of the proposed method were validated. [ABSTRACT FROM AUTHOR]

The gap between software design and implementation often results in a lack of clarity and precision. Formal languages, based on mathematical rules, logic, and symbols, are invaluable for specifying and verifying system designs. Various semi-formal and formal languages, such as JSON, XML, predicate logic, and regular expressions, along with formal models like Turing machines, serve specific domains. This paper introduces a new specification formal language, ObTFL (Object Transaction Formal Language), developed for general-purpose distributed systems, such as specifying the interactions between servers and IoT devices and their security protocols. The paper details the syntax and semantics of ObTFL and presents three real case studies—federated learning, blockchain for crypto and bitcoin networks, and the industrial PCB board with machine synchronization—to demonstrate its versatility and effectiveness in formally specifying the interactions and behaviors of distributed systems. [ABSTRACT FROM AUTHOR]

The gap between software design and implementation often results in a lack of clarity and precision. Formal languages, based on mathematical rules, logic, and symbols, are invaluable for specifying and verifying system designs. Various semi-formal and formal languages, such as JSON, XML, predicate logic, and regular expressions, along with formal models like Turing machines, serve specific domains. This paper introduces a new specification formal language, ObTFL (Object Transaction Formal Language), developed for general-purpose distributed systems, such as specifying the interactions between servers and IoT devices and their security protocols. The paper details the syntax and semantics of ObTFL and presents three real case studies—federated learning, blockchain for crypto and bitcoin networks, and the industrial PCB board with machine synchronization—to demonstrate its versatility and effectiveness in formally specifying the interactions and behaviors of distributed systems.

The paper gives a partial answer to the question as to what groups can be represented as isometry groups of formal languages for generalized Levenshtein distances. Namely, it is proved that, for any language, the absolute value of the difference between the length of any of its words and the length of the image of this word under an isometry with respect to an arbitrary generalized Levenshtein distance is bounded above by a constant that depends only on the language, provided that the distance satisfies the condition that the weight of the substitution operation is less than the doubled weight of the deletion operation. It follows, in particular, that the isometry groups of formal languages for such distances can always be embedded in the group . A number of examples showing that this estimate is sharp in a certain sense are also constructed. [ABSTRACT FROM AUTHOR]

SEL, a State-based Language for Video Surveillance Modeling, is a formal language designed to represent and identify activities in surveillance systems through scenario semantics and the creation of motion primitives structured in programs. Motion primitives represent the temporal evolution of motion evidence. They are the most basic motion structures detected as motion evidence, including operators such as sequence, parallel, and concurrency, which indicate trajectory evolution, simultaneity, and synchronization. SEL is a very expressive language that characterizes interactions by describing the relationships between motion primitives. These interactions determine the scenario's activity and meaning. An experimental model is constructed to demonstrate the value of SEL, incorporating challenging activities in surveillance systems. This approach assesses the language's suitability for describing complicated tasks. [ABSTRACT FROM AUTHOR]

SEL, a State-based Language for Video Surveillance Modeling, is a formal language designed to represent and identify activities in surveillance systems through scenario semantics and the creation of motion primitives structured in programs. Motion primitives represent the temporal evolution of motion evidence. They are the most basic motion structures detected as motion evidence, including operators such as sequence, parallel, and concurrency, which indicate trajectory evolution, simultaneity, and synchronization. SEL is a very expressive language that characterizes interactions by describing the relationships between motion primitives. These interactions determine the scenario’s activity and meaning. An experimental model is constructed to demonstrate the value of SEL, incorporating challenging activities in surveillance systems. This approach assesses the language’s suitability for describing complicated tasks.

Let \(G\) be a quasi-transitive, locally finite, connected graph rooted at a vertex \(o\), and let \(c_n(o)\) be the number of self-avoiding walks of length \(n\) on \(G\) starting at \(o\). We show that if \(G\) has only thin ends, then the generating function \(F_{\mathrm{SAW},o}(z)=\sum_{n \geq 1} c_n(o) z^n\) is an algebraic function. In particular, the connective constant of such a graph is an algebraic number.If \(G\) is deterministically edge-labelled, that is, every (directed) edge carries a label such that no two edges starting at the same vertex have the same label, then the set of all words which can be read along the edges of self-avoiding walks starting at \(o\) forms a language denoted by \(L_{\mathrm{SAW},o}\). Assume that the group of label-preserving graph automorphisms acts quasi-transitively. We show that \(L_{\mathrm{SAW},o}\) is a \(k\)-multiple context-free language if and only if the size of all ends of \(G\) is at most \(2k\). Applied to Cayley graphs of finitely generated groups this says that \(L_{\mathrm{SAW},o}\) is multiple context-free if and only if the group is virtually free.Mathematics Subject Classifications: 20F10, 68Q45, 05C25Keywords: Self avoiding walk, formal language, multiple context free language, Cayley graph, virtually free group

The aim of research was to identify and determine interactive and conflict strategies of bilingual teachers and students in Iran's monolingual educational system through the analysis of their lived experiences. This was a qualitative study using phenomenological approach and research population included all the teachers and pupils of the primary schools in five selected cities of Kermanshah province selected through purposeful sampling method. The sample size of the research for teachers was fifteen (9 male and 6 female teachers of Grades 1-6) and for pupils including five classes (three boys' classes and two girls' classes of Grade 6) with an average of 31 students in each class (in total 155 students). To collect data, researchers used semi-structured interviews with teachers and group interviews with students, and for data analysis, Braun, & Clarke thematic method was used. The first finding of the research indicates that the reaction of teachers and students about formal language can be divided into two groups of interactive and conflict strategies. In terms of nature, both types of strategies are based on the three principles of acceptance, submission and resistance. The second finding revealed that teachers simultaneously benefit from strategies based on positive and negative reinforcement to promote the Persian language in the classroom and school. The third finding shows that some teachers and pupils have defensive reactions against the "linguistic assimilation" policy of the formal education system. According to the findings, it is suggested to Iranian educational planners to increase the role of mother tongue in the learning process of bilingual students. [ABSTRACT FROM AUTHOR]

Assessments constitute a fundamental and inevitable component of any educational journey. Manual effort required for the evaluation of these assessments is very high. Automation of the evaluation process and grading helps in making the review process more efficient, objective, and scalable, thereby reducing the workload of human reviewers. Automating the grading process for multiple-choice and short-answer assessments is relatively straightforward, but it poses significant challenges when applied to the evaluation of formal languages, particularly in the context of mathematical assessments. In this paper a model that automatically evaluates and grades the Quadratic Equation problems is presented. The study is conducted using a manually curated dataset comprising 1200 solutions to various quadratic equation problems. Embeddings of the quadratic solutions are generated using Google's T5 Model. These embeddings are then used to train different traditional and ensembled machine learning models along with complex Deep learning models like LSTM and Bi LSTM. An in-depth analysis of the fine-tuned T5 model's performance, evaluating its effectiveness in comparison with the pretrained T5 model in automatic grading of quadratic equation problems has been explored. Fine-tuning significantly contributes to the reduction of error by 70% and a noticeable increase in the R2 value to 97%. [ABSTRACT FROM AUTHOR]

Copyright of Przestrzeń Urbanistyka Architektura is the property of Cracow University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Lambek categorial grammars is a class of formal grammars based on the Lambek calculus. Pentus proved in 1993 that they generate exactly the class of context-free languages without the empty word. In this paper, we study categorial grammars based on the Lambek calculus with the permutation rule LP. Of particular interest is the product-free fragment of LP called the Lambek-van Benthem calculus LBC. Buszkowski in his 1984 paper conjectured that grammars based on the Lambek-van Benthem calculus (LBC-grammars for short) generate exactly permutation closures of context-free languages. In this paper, we disprove this conjecture by presenting a language generated by an LBC-grammar that is not a permutation closure of any context-free language. Firstly, we introduce an ad-hoc modification of vector addition systems called linearly-restricted branching vector addition systems with states and additional memory (LRBVASSAMs for short) and prove that the latter are equivalent to LBC-grammars. Then we construct an LRBVASSAM that generates a non-semilinear set and thus disprove Buszkowski's conjecture. Since Buszkowski's conjecture is false, not so much is known about the languages generated by LBC-grammars or by LP-grammars. The equivalence of LRBVASSAMs and LBC-grammars allows us to establish a number of their properties. We show that LP-grammars generate the same class of languages as LBC-grammars; that is, removing product from LP does not decrease expressive power of corresponding categorial grammars. We also prove that this class of languages is closed under union, intersection, concatenation, and Kleene plus. [ABSTRACT FROM AUTHOR]

Language plays a fundamental role in the teaching and learning of mathematics. Students rely on their literacy skills to comprehend problem-solving situations before applying their mathematical knowledge. Unfortunately, there have been numerous reports of illiteracy, particularly in the area of communication, which is one of the most important skills in mathematical literacy. The students' lack of experience connecting formal mathematical language with their everyday language is one factor contributing to their communication illiteracy. To address this issue, the current study uses Desmos Polygraph as a tool to promote mathematical literacy by encouraging a thorough understanding of formal language. Desmos Polygraph's effective use encourages students to use formal language and understand the relationship between formal and informal language. This study, on the other hand, is solely concerned with analyzing the language used in the activity. Further research could assess the student-teacher interaction during the Desmos Polygraph activity to determine other potential in enhancing mathematical literacy.

This paper proposes an interpretable geometry solution based on the formal language set of text and diagram. Geometry problems are solved using machines; however, machines encounter challenges in natural language processing and computer vision. Significant progress has improved existing methods in the extraction of geometric formal languages. However, the neglect of the graph structure information in the formal language and the lack of further refinement of the extracted language set can lead to poor theorem prediction and poor accuracy in problem solving. In this paper, a formal language graph is constructed using the extracted formal language set and applied to theorem prediction using a graph convolutional network. To better extract the relationship set of diagram elements, an improved diagram parser is proposed. The test results indicate that the improved method has good results when solving interpretable geometry problems. [ABSTRACT FROM AUTHOR]

Learning programming and using programming languages are the essential aspects of computer science education. Students use programming languages to write their programs. These computer programs (students or practitioners written) make computers artificially intelligent and perform the tasks needed by the users. Without these programs, the computer may be visioned as a pointless machine. As the premise of writing programs is situated with specific programming languages, enormous efforts have been made to develop and create programming languages. However, each programming language is domain-specific and has its nuances, syntax and semantics, with specific pros and cons. These language-specific details, including syntax and semantics, are significant hurdles for novice programmers. Also, the instructors of introductory programming courses find these language specificities as the biggest hurdle in students learning, where more focus is on syntax than logic development and actual implementation of the program. Considering the conceptual difficulty of programming languages and novice students' struggles with the language syntax, this paper describes the design and development of a Context-Free Grammar (CFG) of a programming language for the novice, newcomers and students who do not have computer science as their major. Due to its syntax proximity to daily conversations, this paper hypothesizes that this language will be easy to use and understand by novice programmers. This paper systematically designed the language by identifying themes from various existing programming languages (e.g., C, Python). Additionally, this paper surveyed computer science experts from industry and academia, where experts self-reported their satisfaction with the newly designed language. The results indicate that 93% of the experts reported satisfaction with the NewBee for novice, newcomer and non-Computer Science (CS) major students. [ABSTRACT FROM AUTHOR]

In the classical theory of regular languages, the concept of recognition by profinite monoids is an important tool. Beyond regularity, Boolean spaces with internal monoids (BiMs) were recently proposed as a generalization. On the other hand, fragments of logic defining regular languages can be studied inductively via the so-called "Substitution Principle." In this paper, we make the logical underpinnings of this principle explicit and extend it to arbitrary languages using Stone duality. Subsequently, we show how it can be used to obtain topo-algebraic recognizers for classes of languages defined by a wide class of first-order logic fragments. This naturally leads to a notion of semidirect product of BiMs extending the classical such construction for profinite monoids. Our main result is a generalization of Almeida and Weil's Decomposition Theorem for semidirect products from the profinite setting to that of BiMs. This is a crucial step in a program to extend the profinite methods of regular language theory to the setting of complexity theory. [ABSTRACT FROM AUTHOR]

Models have evolved from mere pictures supporting human understanding and communication to sophisticated knowledge structures processable by machines and establish value through their processing capabilities. This entails an inevitable need for computer-understandable modeling languages and causes formalization to be a crucial part in the lifecycle of engineering a modeling method. An appropriate formalism must be a means for providing a structural definition to enable a theoretical investigation of conceptual modeling languages and a unique, unambiguous way of specifying the syntax and semantics of an arbitrary modeling language. For this purpose, it must be generic and open to capturing any domain and any functionality. This paper provides a pervasive description of the formalism MetaMorph based on logic and model theory—an approach fulfilling the requirements above for modeling method engineering. The evaluation of the formalism is presented following three streams of work: First, two evaluative case studies illustrate the applicability of MetaMorph formalism concept by concept on the modeling language ProVis from the domain of stochastic education and the well-known Entity-Relationship language. ProVis as well as ER comprise only a few objects and relation types but with high interconnection and expressive power and are therefore considered interesting specimens for formalization. Second, a comprehensive juxtaposition of MetaMorph to three other formalization approaches based on different foundational theories is outlined concept by concept to underpin the formalism design. Third, an empirical evaluation has been performed, assessing the usability and adequacy of the formalism within a classroom assessment. The results allow for conclusions on the completeness, intuitiveness, and complexity as well as on interdependencies with engineers' skills. [ABSTRACT FROM AUTHOR]

This treatise delves into the construction and formalization of a precise theory to encapsulate a pivotal facet of Thomas Aquinas's ontology. In particular, it focuses on the development of a formal language that is adequate for formulating Aquinas's understanding of the simultaneous nature of divinity as both an object of subsistence and a universal, individual, and actuating form--a concept evocative of the original Platonic sense of form. The presented axiomatized theory as a medium for expounding the ontological principles enunciated by Thomas Aquinas. A comprehensive set of axioms is systematically justified, exhibiting their congruence with Aquinas's ontological doctrines. To elucidate this harmony, an extensive series of theorems is deduced, closely aligned with the verbal tenets of Aquinas's teachings. The inherent consistency of the axiom system is proven by the provision of a geometricotopological model tailored to support it. [ABSTRACT FROM AUTHOR]

Copyright of Cogency: Journal of Reasoning & Argumentation is the property of Cogency Journal and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Analysing communication strategies remains crucial to overcome communication problems in classroom interaction since it directs the students to receive successful English learning results. One strategy to communicate is applying an appropriate language level of formality in the classroom. However, there have been very limited researches that explore formal and informal languages in the classroom context. This research aims to discuss the characteristics and factors influencing students in using formal and informal expressions in the classroom presentation-interaction. This research applied a qualitative method taking twenty-two students of Universitas Negeri Makassar as participants. The data from classroom observation, voice-recording, and interview were analysed using the discourse analysis approach. The result of the research shows that characteristics of formal and informal language are absolutely opposite, namely complete versus uncompleted sentence, politeness versus familiarity words, and precise versus colloquialism words. The result of the research also shows factors influencing the use of formal and informal language are formal situations, communication purposes, status and age differences, and familiarity. This research also found the relation of using formal language as students' strategies to be polite to the lecturer in classroom interaction. Results of this research are significant for students in shaping good strategies in using formal or informal language expressions to achieve effective communication in classroom interaction.

In the vein of a renewed interest in diagrammatic reasoning, this paper challenges an opposition between logic diagrams and formal languages that has traditionally been the common view in philosophy of logic and linguistics. We examine, from a philosophical point of view, what we call five dogmas of logic diagrams. These are as follows: (1) diagrams are non-linguistic; (2) diagrams are visual representations; (3) diagrams are iconic, and not symbolic; (4) diagrams are non-linear; (5) diagrams are heterogenous, and not homogenous. Using historical examples, we argue that none of these dogmas is an adequate criterion to distinguish logic diagrams from formal languages. Instead, we advocate that there is a common core between linguistic and diagrammatic representation and reasoning. • We critically examine, from a philosophical point of view, five dogmas in current research on logic diagrams that have been proposed as criteria to establish an opposition between formal language and logic diagrams. • The dogmas we consider are: (1) diagrams are non-linguistic ; (2) diagrams are visual representations; (3) diagrams are iconic , and not symbolic ; (4) diagrams are non-linear; (5) diagrams are heterogenous , and not homogenous. • We present historical examples which are not met by these criteria. • We provide a positive outlook by arguing that there is a common core between linguistic and diagrammatic representation and reasoning, which can be called 'invariance'. [ABSTRACT FROM AUTHOR]

Enterprise modeling deals with the increasing complexity of processes and systems by operationalizing model content and by linking complementary models and languages, thus amplifying the model value beyond mere comprehensible pictures. To enable this amplification and turn models into computer-processable structures, a comprehensive formalization is needed. This paper presents the formalism MetaMorph based on typed first-order logic and provides a perspective on the potential and benefits of formalization that arise for a variety of research issues in conceptual modeling. MetaMorph defines modeling languages as formal languages with a signature Σ —comprising object types, relation types, and attributes through types and function symbols—and a set of constraints. Four case studies are included to show the effectiveness of this approach. Applying the MetaMorph formalism to the next level in the hierarchy of models, we create M2FOL, a formal modeling language for metamodels. We show that M2FOL is self-describing and therefore complete the formalization of the full four-layer metamodeling stack. On the basis of our generic formalism applicable to arbitrary modeling languages, we examine four current research topics—modeling with power types, language interleaving & consistency, operations on models, and automatic translation of formalizations to platform-specific code—and how to approach them with the MetaMorph formalism. This shows that the rich knowledge stack on formal languages in logic offers new tools for old problems. [ABSTRACT FROM AUTHOR]

We study the problem of recovering distorted arbitrarily long messages written in some dynamically specified formal language. We obtain necessary and sufficient conditions on the language definition for an admissible message to exist in a neighborhood of a distorted message provided that local perturbations occur rarely. [ABSTRACT FROM AUTHOR]

In the oriental practice of art and architecture, and among the regions under their influence, Islamic geometric patterns (IGPs) have been widely used, not only due to aesthetics and decoration but also to make it possible to cover wide flat surfaces, curved surface of domes, and perforated surfaces of window and partitions, with perfectly tessellated shapes. However, with advances in time and technology, these techniques could not connect to the new technologies and benefit from the capacities of digitalization. Recent progress in science and technology tends to open new doors to study geometrical patterns by digitalizing the old ones and developing new variations. This study looks at formal grammar and computer science to introduce a new approach to digital visualization of available IGPs, particularly, star patterns. We investigate the potentials of developing a re-writing system for simulation of IGPs to provide a flexible platform, which allows introducing IGP to CAD/CAM software without previous knowledge on their design or drawing techniques. This methodology allows designers to directly develop various scenarios of IGP applications and implement them on related CAD/CAM tools. Formal language and grammar theories, based on applied mathematics are contributing to the advancements of computer science and digital modeling. They can provide an opportunity to express relational definition and written equivalents of the geometries by using strings and symbols. It is supposed that by using the formal grammar frameworks, certain languages could be developed to visualize IGPs in a machine-friendly way, and consequently, this computational interpretation of IGPs facilitates their application and further developments, for example, regards to digital fabrication. The presented method of IGP visualization is developed as a C#-based add-on for Grasshopper in Rhino3D, one of the main modeling tools used by architects and product designers. [ABSTRACT FROM AUTHOR]

An orbit pattern α is said to force an orbit pattern β , if any continuous interval map which admits α also admits β . Among the orbit patterns that force only eventually fixed trajectories, we completely describe the forcing relation, by answering the question: which orbit patterns force which others? We provide two different ways to enlist them completely through formal languages. One is through constructed words and another is by derived words. [ABSTRACT FROM AUTHOR]

We prove lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity. First, we show a reduction: the length of a regular expression for a language L ⊆ { 0 , 1 } n is bounded from below by the minimum size of a monotone arithmetic formula computing a polynomial that has L as its set of exponent vectors. This result yields lower bounds for the language of all words with exactly k ones and n − k zeros and for the language of all Dyck words of length 2 n. Second, we adapt a lower bound method for multilinear arithmetic formulas by so-called log-product polynomials to regular expressions. With this method we show almost tight lower bounds for the language of all n -bit binary numbers that are divisible by a given odd integer p and for the language of all permutations of { 1 , ... , n }. [ABSTRACT FROM AUTHOR]

Automated creation of a conceptual data model based on user requirements expressed in the textual form of a natural language is a challenging research area. The complexity of natural language requires deep insight into the semantics buried in words, expressions, and string patterns. For the purpose of natural language processing, we created a corpus of business descriptions and an adherent lexicon containing all the words in the corpus. Thus, it was possible to define rules for the automatic translation of business descriptions into the entity–relationship (ER) data model. However, since the translation rules could not always lead to accurate translations, we created an additional classification process layer—a classifier which assigns to each input sentence some of the defined ER method classes. The classifier represents a formalized knowledge of the four data modelling experts. This rule-based classification process is based on the extraction of ER information from a given sentence. After the detailed description, the classification process itself was evaluated and tested using the standard multiclass performance measures: recall, precision and accuracy. The accuracy in the learning phase was 96.77% and in the testing phase 95.79%. [ABSTRACT FROM AUTHOR]

The term "controlled language" is used to refer to an important step in preparing the text for machine translation or rather the rules the writer needs to abide by in order to prepare the text for the translation. It usually relates to the translation of specialised texts (registers, such as engineering, medicine, economy etc.). On the other hand, "plain language" is aimed at the simplification of formal language and is primarily used in official public documents (legal acts, contracts, administrative forms etc.). This paper discusses whether there are any similarities between the controlled language and plain language in order to determine if both can be understood as useful linguistic tools in controlled writing teaching and usage. [ABSTRACT FROM AUTHOR]

Copyright of Akademik Sanat is the property of Ankara Haci Bayram Veli University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)