Results 21 to 30 of about 4,664,026 (360)
Querying Regular Languages over Sliding Windows
Foundations of Software Technology and Theoretical Computer Science, 2016 Moses Ganardi +2 more
openalex +3 more sources
Co-lexicographically Ordering Automata and Regular Languages - Part I [PDF]
Journal of the ACM, 2022 The states of a finite-state automaton 𝒩 can be identified with collections of words in the prefix closure of the regular language accepted by 𝒩. But words can be ordered, and among the many possible orders a very natural one is the co-lexicographic ...
Nicola Cotumaccio +3 more
semanticscholar +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
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
Interval type-2 fuzzy automata and Interval type-2 fuzzy grammar [PDF]
, 2021 The purpose of the present work is to introduce and study the concept of interval type-2 (IT2) fuzzy grammar which recognizes the given IT2 fuzzy languages. The relationship between IT2 fuzzy automata and IT2 fuzzy (weak) regular grammars is discussed.
Kavikumar, Jacob +2 more
core +1 more source
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
Sliding window property testing for regular languages [PDF]
International Symposium on Algorithms and Computation, 2019 We study the problem of recognizing regular languages in a variant of the streaming model of computation, called the sliding window model. In this model, we are given a size of the sliding window $n$ and a stream of symbols. At each time instant, we must
Moses Ganardi +3 more
semanticscholar +1 more source
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
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