scholarly journals On the Languages Accepted by Watson-Crick Finite Automata with Delays

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 813
Author(s):  
José M. Sempere
Keyword(s):  
Finite Automata ◽  
Transition Function ◽  
Maximum Length ◽  
Computational Power ◽  
Language Class ◽  
Length Difference ◽  
Proper Subclass ◽  
Language Classes

In this work, we analyze the computational power of Watson-Crick finite automata (WKFA) if some restrictions over the transition function in the model are imposed. We consider that the restrictions imposed refer to the maximum length difference between the two input strands which is called the delay. We prove that the language class accepted by WKFA with such restrictions is a proper subclass of the languages accepted by arbitrary WKFA in general. In addition, we initiate the study of the language classes characterized by WKFAs with bounded delays. We prove some of the results by means of various relationships between WKFA and sticker systems.

scholarly journals ORGANIZATION OF STUDENTS’ RESEARCH WORK IN A FOREIGN LANGUAGE

2019 ◽  
Vol 1 (16) ◽  
pp. 105-111
Author(s):  
H.M Shalatska
Keyword(s):  
Foreign Language ◽  
Research Work ◽  
Gradual Transition ◽  
Student Writing ◽  
Student Research ◽  
Language Class ◽  
Study Results ◽  
Language Classes ◽  
Language Environment ◽  
Made In

The article considers the peculiarities of the organization of students’ research work in a technical university in foreign language classes with a gradual transition from simple forms of research to more complex ones, which is aimed at the harmonious development and improvement future specialists’ skills and abilities. The purpose of this article is to identify the main problems of the organization of students’ research work in a foreign language and consider ways of improving this process. Special attention is paid to the tasks, functions, components and various forms of students' research work. The researcher describes the possibility of using assignments for research work and organizing their performing by students in a foreign language class, in particular, such tasks as writing a summary of the text proposed by the teacher, corresponding to the student’s specialization, drawing up a plan for it, drawing up terminological dictionaries, preparing reports on a given topic, writing creative works, essays, drawing up tables and diagrams, solving problematic issues related to the future profession of a student, writing abstracts,  preparing the presentation of study' results. The involvement students in the work of scientific conferences, seminars, competitions, contests, and meetings with leading foreign experts are encouraged. The defense of master's and diploma projects in a foreign language prepares the student for the exercise of profession and integration into a foreign language environment. The examples of the most common mistakes made in the preparation of research works, which indicate the lack of students’ research skills formation are given, and ways to overcome them are recommended. The conclusions are related and future works are suggested. Thus, it also possible to create an education plans of student’ research work in foreign language and recommendations for the specific academic curriculum.

The Use of Creolized English in FL Classes in Barbados

2021 ◽  
pp. 85-104
Author(s):  
Paula González ◽  
Korah L. Belgrave ◽  
Janice E. Jules
Keyword(s):  
Foreign Language ◽  
20Th Century ◽  
First Language ◽  
Controversial Issues ◽  
Language Class ◽  
Language Classes ◽  
Students First ◽  
Language Classrooms ◽  
Language Students ◽  
Foreign Language Classrooms

One of the most controversial issues in the teaching of modern languages throughout the 20th century has been without a doubt the debate on the use of students' first language in foreign language classrooms. In that regard, there have been many and varied arguments for and against this. In this chapter there is a review both of the reasons that have been discussed to reject the presence of L1 in the foreign language class and those in favor of including this language. In addition, the findings of research on Caribbean foreign language students' opinions and beliefs on the use of L1/HL in their language classes are presented. The chapter considers the students' views on the specific classroom contexts in which they consider the L1/HL useful in their process of learning the foreign language.

Efficient Symbolic Representations for Arithmetic Constraints in Verification

2003 ◽  
Vol 14 (04) ◽  
pp. 605-624 ◽  
Author(s):  
Constantinos Bartzis ◽  
Tevfik Bultan
Keyword(s):  
Finite Automata ◽  
Transition Function ◽  
Linear Constraints ◽  
Symbolic Representations ◽  
Integer Variables ◽  
Efficient Storage ◽  
Verification Algorithms ◽  
Infinite State Systems ◽  
Construction Algorithms ◽  
Infinite State

In this paper we discuss efficient symbolic representations for infinite-state systems specified using linear arithmetic constraints. We give algorithms for constructing finite automata which represent integer sets that satisfy linear constraints. These automata can represent either signed or unsigned integers and have a lower number of states compared to other similar approaches. We present efficient storage techniques for the transition function of the automata and extend the construction algorithms to formulas on both boolean and integer variables. We also derive conditions which guarantee that the pre-condition computations used in symbolic verification algorithms do not cause an exponential increase in the automata size. We experimentally compare different symbolic representations by using them to verify non-trivial concurrent systems. Experimental results show that the symbolic representations based on our construction algorithms outperform the polyhedral representation used in Omega Library, and the automata representation used in LASH.

ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA

1996 ◽  
Vol 25 (3,4) ◽  
pp. 285-293 ◽  
Author(s):  
D. Derencourt ◽  
J. Karhumäki ◽  
M. Latteux ◽  
A. Terlutte
Keyword(s):  
Finite Automata ◽  
Computational Power ◽  
Weighted Finite Automata

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities

2015 ◽  
Vol 26 (08) ◽  
pp. 1101-1126 ◽  
Author(s):  
Henning Bordihn ◽  
Martin Kutrib ◽  
Andreas Malcher
Keyword(s):  
Finite Automata ◽  
Computational Power ◽  
Deterministic Finite Automata ◽  
Initial States

Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted, that is, when the number of necessary communications during the computations of the system is bounded by a function depending on the length of the input. The computational power and decidability problems are studied for returning systems, where components are set back to their initial states after having answered communication requests. It is proved that an infinite, strict hierarchy of language families exists, induced by the number of messages sent by their most economical acceptors. It is shown that at least one gap in this hierarchy exists. Some levels in the hierarchy are investigated in more detail.

scholarly journals On Computational Power of Partially Blind Automata

2012 ◽  
Vol 8 (1) ◽  
pp. 33-41
Author(s):  
Pavol Ďuriš
Keyword(s):  
Finite Automata ◽  
The Other ◽  
Computational Power

On Computational Power of Partially Blind Automata In this paper we deal with 1-way multihead finite automata, in which the symbol under only one head (called read head) controls its move and other heads cannot distinguish the input symbols, they can only distinguish the end-marker from the other input symbols and they are called the blind head. We call such automaton a partially blind multihead automaton. We prove that partially blind k + 1-head finite automata are more powerful than such k-head finite automata. We show also that nondeterministic partially blind k-head finite automata languages are not closed under iteration and intersection for any k ≥ 2, and moreover, deterministic partially blind k head finite automata languages are not closed under intersection, union, complementation and reversal for any k ≥ 2. Finally we prove that deterministic partially blind k-head finite automata with endmarker are more powerful that such automata without endmarker for each k ≥ 4.

scholarly journals Pengaruh Program Kelas Bahasa Arab pada Lembaga CELAD terhadap Penguasaan Mufrodat (Kosa Kata) Mahasiswa

2019 ◽  
Vol 16 (1) ◽  
pp. 58-77
Author(s):  
Mawardi Ahmad ◽  
Ismail Akzam ◽  
Yenni Yunita
Keyword(s):  
Language Learning ◽  
Student Learning ◽  
Quantitative Research ◽  
Descriptive Analysis ◽  
Arabic Language ◽  
Quantitative Descriptive Analysis ◽  
Islamic Studies ◽  
Language Class ◽  
Language Classes ◽  
Language Mastery

This study was motivated by the problem of mastering Arabic in the Faculty of Islamic studies (FAI), Islamic university of Riau (UIR). This problem focused on the students’ quality and learning interest of FAI UIR on language mastery, both Arabic and English. This foreign language or second language mastery program such as Arabic or English is made in the form of language classes. Language classes are initially unattended by a special institution such as a language center now under the supervision of the FAI UIR language center, the forerunner of the UIR language center called CELAD (Center for Languages ​​and Academic Development). Formulation The problem of this research is how the implementation of Arabic learning and the influence of the Arabic language class on the mastery of student learning in the Faculty of Islamic Studies UIR. The purpose of this study was to find out the implementation of Arabic learning and the influence of the Arabic language class on the mastery of student learning in the Faculty of Islamic studies. The type of this research is descriptive as well as qualitiative and quantitative research. The literature review used is language learning, the influence of the Arabic language class, and vocabulary mastery (al-mufradat). Then based on the results of the study using quantitative descriptive analysis, it found that the implementation of Arabic learning and the influence of the Arabic class on students’ vocabulary mastery of FAI UIR can be said to be "good".

scholarly journals Outwit, Outlast, Outplay: Survival Techniques (for Teachers and Students) in the Large Language Classroom

2016 ◽  
Author(s):  
Teresa Lobalsamo ◽  
Ramón A. Victoriano-Martínez
Keyword(s):  
Learning Environment ◽  
Student Body ◽  
Large Classes ◽  
Language Class ◽  
Language Classes ◽  
Language Classroom ◽  
Teachers And Students

What once began as experimental has now become a trend whereby large classes (50 students or more) are the norm. Language classes, where a small student body is ever more preferred, is also part of the same growing movement. Literature tells us, however, that students feel the larger the size of the class, the more negatively it will affect their ability to learn; yet, universities are reluctant to provide the small classes that are essential for an effective and organic learning environment. The following paper provides readers with 1. a brief summary of the research conducted on the effectiveness or otherwise of large classes; 2. practices that the authors have found to be most effective for the successful delivery of a large language class - practices which can also be implemented in lectures with fewer students.

scholarly journals Reversible parallel communicating finite automata systems

2021 ◽  
Vol 58 (4) ◽  
pp. 263-279
Author(s):  
Henning Bordihn ◽  
György Vaszil
Keyword(s):  
Finite Automata ◽  
Regular Languages ◽  
The Other ◽  
Deterministic Case ◽  
Computational Power ◽  
Deterministic Finite Automata ◽  
Relationship Of ◽  
The Relationship ◽  
Context Free

AbstractWe study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.

Sign in / Sign up

Export Citation Format

Share Document