Results 31 to 40 of about 4,638,570 (374)
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
MEASURE OF REGULAR LANGUAGES [PDF]
Demonstratio Mathematica, 2004 Asok Ray, Amit Surana
openaire +3 more sources
New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ...
Jorge Almeida, Ondrej Klima
doaj +1 more source
The genus of regular languages [PDF]
Mathematical Structures in Computer Science, 2016 The paper defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, an FSA can be seen as a graph for which the notion of genus arises. At the same time, an FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus.
Bonfante, Guillaume, Deloup, Florian
openaire +5 more sources
Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted.
Lorenz A. Gilch
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
Most Complex Regular Ideal Languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for two-sided ideals. We show that there
Janusz Brzozowski +2 more
doaj +1 more source
A Quantum Query Complexity Trichotomy for Regular Languages [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We present a trichotomy theorem for the quantum query complexity of regular languages. Every regular language has quantum query complexity Θ(1), ~Θ(√ n), or Θ(n).
S. Aaronson, Daniel Grier, L. Schaeffer
semanticscholar +1 more source
A Cognitive Regularizer for Language Modeling [PDF]
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2021 The uniform information density (UID) hypothesis, which posits that speakers behaving optimally tend to distribute information uniformly across a linguistic signal, has gained traction in psycholinguistics as an explanation for certain syntactic, morphological, and prosodic choices.
Wei, Jason +2 more
openaire +4 more sources
Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strict unboundedness), and ωBS-regular ...
Dario Della Monica +2 more
doaj +1 more source