Results 1 to 10 of about 4,711,783 (279)
Regular Languages and Associative Language Descriptions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The Associative Language Description model (ALD) is a combination of locally testable and constituent structure ideas. It is consistent with current views on brain organization and can rather conveniently describe typical technical languages such as ...
Marcella Anselmo +2 more
doaj +6 more sources
Journal of Language Modelling, 2023 This paper proposes a formal model of regular languages enriched with unbounded copying. We augment finite-state machinery with the ability to recognize copied strings by adding an unbounded memory buffer with a restricted form of first-in-first-out ...
Yang Wang, Tim Hunter
doaj +3 more sources
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers
Algorithms, 2018 The concept of edit distance and its variants has applications in many areas such as computational linguistics, bioinformatics, and synchronization error detection in data communications.
Lila Kari +3 more
doaj +3 more sources
Моделирование и анализ информационных систем, 2021 Sequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the streams of instructions or responses.
Anton Romanovich Gnatenko +1 more
doaj +1 more source
On the Model Checking Problem for Some Extension of CTL*
Моделирование и анализ информационных систем, 2020 Sequential reactive systems include programs and devices that work with two streams of data and convert input streams of data into output streams. Such information processing systems include controllers, device drivers, computer interpreters.
Anton Romanovich Gnatenko +1 more
doaj +1 more source
Balanced-by-Construction Regular and ω-Regular Languages
International Journal of Foundations of Computer Science, 2021 Parenn is the typical generalization of the Dyck language to multiple types of parentheses. We generalize its notion of balancedness to allow parentheses of different types to freely commute. We show that balanced regular and [Formula: see text]-regular languages can be characterized by syntactic constraints on regular and [Formula: see text]-regular ...
Luc Edixhoven, Sung-Shik Jongmans
openaire +5 more sources
Odometers on Regular Languages [PDF]
Theory of Computing Systems, 2005 Odometers or "adding machines" are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this notion to systems defined on an arbitrary infinite regular language. In this latter situation, if (A,
Berthé,, Rigo, Michel
openaire +3 more sources
Language learning with physical activity: The case of learning Italian in tourism [PDF]
Training, Language and Culture, 2021 The aim of the paper is to present how movement improves language learning in the case of rehearsing regular and irregular Italian verbs. In the paper we address the importance of language learning in the frame of Language for Special Purposes (LSP ...
Mojca Kompara Lukančič
doaj +1 more source
Regular omega-Languages with an Informative Right Congruence [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The same
Dana Angluin, Dana Fisman
doaj +1 more source
An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law.
Ryoma Sin'ya
doaj +1 more source