Results 1 to 10 of about 246,419 (266)
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 +3 more sources
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 +2 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
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
Ambiguity Hierarchy of Regular Infinite Tree Languages [PDF]
Logical Methods in Computer Science, 2021 An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is k-ambiguous for some
Alexander Rabinovich, Doron Tiferet
doaj +1 more source
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 +1 more source
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 +1 more source
The production of nominal and verbal inflection in an agglutinative language: evidence from Hungarian. [PDF]
PLoS ONE, 2015 The contrast between regular and irregular inflectional morphology has been useful in investigating the functional and neural architecture of language.
Dezso Nemeth +8 more
doaj +1 more source