Results 1 to 10 of about 1,782,235 (292)
On regular copying languages [PDF]
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 +6 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 +7 more sources
Regular Monoidal Languages [PDF]
CoRR, 2022 We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of languages over string diagrams.
Matthew Earnshaw, Pawel Sobocinski 0001
core +7 more sources
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
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
Quotient Complexity of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented.
Janusz Brzozowski
doaj +1 more source
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
Complexity in Prefix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible.
Galina Jirásková, Monika Krausová
doaj +1 more source
Valuing All Languages in Europe [PDF]
, 2007 The VALEUR project (2004-2007) took as its focus the 'additional' languages of Europe. These are defined as all languages in use in contexts where they are not 'national', 'official', or 'dominant' languages.
McPake, Joanna +7 more
core +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