Zobrazeno 1 - 10
of 33 324
pro vyhledávání: '"automata theory"'
Autor:
Mielczarek, Lukas
Syntactic parsing is essential in natural-language processing, with constituent structure being one widely used description of syntax. Traditional views of constituency demand that constituents consist of adjacent words, but this poses challenges in
Externí odkaz:
http://arxiv.org/abs/2410.08766
Autor:
Raskin, Jean-François, Tsai, Yun Chen
This paper addresses the synthesis of reactive systems that enforce hard constraints while optimizing for quality-based soft constraints. We build on recent advancements in combining reactive synthesis with example-based guidance to handle both types
Externí odkaz:
http://arxiv.org/abs/2410.08599
As an information-flow privacy property, opacity characterizes whether a malicious external observer (referred to as an intruder) is able to infer the secret behavior of a system. This paper addresses the problem of opacity enforcement using edit fun
Externí odkaz:
http://arxiv.org/abs/2410.08471
In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succinctly represented by a grammar generating it, or an automaton accepting
Externí odkaz:
http://arxiv.org/abs/2410.07992
Autor:
Kostičová, Jana
This paper presents an efficient method for LR parsing of permutation phrases. In practical cases, the proposed algorithm constructs an LR(0) automaton that requires significantly fewer states to process a permutation phrase compared to the standard
Externí odkaz:
http://arxiv.org/abs/2410.06769
We present TuringQ, the first benchmark designed to evaluate the reasoning capabilities of large language models (LLMs) in the theory of computation. TuringQ consists of 4,006 undergraduate and graduate-level question-answer pairs, categorized into f
Externí odkaz:
http://arxiv.org/abs/2410.06547
Autor:
Wolpert, David, Scharnhorst, Jordan
Computer science theory provides many different measures of complexity of a system including Kolmogorov complexity, logical depth, computational depth, and Levin complexity. However, these measures are all defined only for deterministic Turing machin
Externí odkaz:
http://arxiv.org/abs/2410.07131
Autor:
Adak, Sumit, Das, Sukanta
This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a bonding betwe
Externí odkaz:
http://arxiv.org/abs/2410.05947
Autor:
Becker, Ruben, Cenzato, Davide, Kim, Sung-Hwan, Kociumaka, Tomasz, Kodric, Bojana, Policriti, Alberto, Prezza, Nicola
Co-lex partial orders were recently introduced in (Cotumaccio et al., SODA 2021 and JACM 2023) as a powerful tool to index finite state automata, with applications to regular expression matching. They generalize Wheeler orders (Gagie et al., Theoreti
Externí odkaz:
http://arxiv.org/abs/2410.04771