Zobrazeno 1 - 10
of 13 140
pro vyhledávání: '"context-free languages"'
Autor:
Considine, Breandan
In the following paper, we present a simple method for sampling trees with or without replacement from BCFLs. A BCFL is a context-free language (CFL) corresponding to an incomplete string with holes, which can be completed by valid terminals. To solv
Externí odkaz:
http://arxiv.org/abs/2408.01849
Autor:
Nogami, Taisei, Terauchi, Tachio
Backreference is a well-known practical extension of regular expressions and most modern programming languages, such as Java, Python, JavaScript and more, support regular expressions with backreferences (rewb) in their standard libraries for string p
Externí odkaz:
http://arxiv.org/abs/2406.18918
Autor:
Das, Anupam, De, Abhishek
We investigate the proof theory of regular expressions with fixed points, construed as a notation for (omega-)context-free grammars. Starting with a hypersequential system for regular expressions due to Das and Pous, we define its extension by least
Externí odkaz:
http://arxiv.org/abs/2404.16231
Autor:
Earnshaw, Matt, Román, Mario
We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include classical co
Externí odkaz:
http://arxiv.org/abs/2404.10653
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We study the problem of deciding whether a given language is directed. A language $L$ is \emph{directed} if every pair of words in $L$ have a common (scattered) superword in $L$. Deciding directedness is a fundamental problem in connection with ideal
Externí odkaz:
http://arxiv.org/abs/2401.07106
Autor:
Gullà, Gabriele
Following a seminar the present author gave to an Automata Theory course to computer science students, it will be presented, in a very synthetic and mostly selfcontained way, the principal properties of context free languages (CFL), with particular a
Externí odkaz:
http://arxiv.org/abs/2403.15899
Autor:
Rukavicka, Josef1
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2023, Vol. 25 Issue 2, p1-11. 11p.
Autor:
Hopkins, Mark, Leiß, Hans
Within the tensor product $K \mathop{\otimes_{\cal R}} C_2'$ of any ${}^*$-continuous Kleene algebra $K$ with the polycyclic ${}^*$-continuous Kleene algebra $C_2'$ over two bracket pairs there is a copy of the fixed-point closure of $K$: the central
Externí odkaz:
http://arxiv.org/abs/2310.17295
Previous work on Dynamic Complexity has established that there exist dynamic constant-time parallel algorithms for regular tree languages and context-free languages under label or symbol changes. However, these algorithms were not developed with the
Externí odkaz:
http://arxiv.org/abs/2307.10131