Výsledky vyhledávání - "Theory of computation Formal languages and automata theory"

A Relational Theory of Monadic Rewriting Systems, Part I Autor Gavazzo, Francesco, Faggian, Claudia

“…Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems. The latter are…”
Získat plný text

Incremental Context-free Grammar Inference in Black Box Settings Autor Li, Feifei, Chen, Xiao, Xiao, Xi, Sun, Xiaoyu, Chen, Chuan, Wang, Shaohua, Han, Jitao

“…Black-box context-free grammar inference presents a significant challenge in many practical settings due to limited access to example programs. The…”
Získat plný text

Parikh's theorem for infinite alphabets Autor Hofman, Piotr, Juzepczuk, Marta, Lasota, Slawomir, Pattathurajan, Mohnish

“…We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this…”
Získat plný text

A Database Dependent Framework for K-Input Maximum Fanout-Free Window Rewriting Autor Zhu, Xuliang, Tang, Ruofei, Chen, Lei, Li, Xing, Huang, Xin, Yuan, Mingxuan, Sheng, Weihua, Xu, Jianliang

“…Rewriting is a widely used logic optimization approach incorporated in most commercial logic synthesis tools. In this paper, we present a new rewriting method…”
Získat plný text

Positive First-order Logic on Words Autor Kuperberg, Denis

“…We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable…”
Získat plný text

SD-Regular Transducer Expressions for Aperiodic Transformations Autor Dartois, Luc, Gastin, Paul, Krishna, Shankara Narayanan

“…FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order…”
Získat plný text

Normalization for Cubical Type Theory Autor Sterling, Jonathan, Angiuli, Carlo

“…We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory…”
Získat plný text

Behavioural Preorders via Graded Monads Autor Ford, Chase, Milius, Stefan, Schroder, Lutz

“…Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation…”
Získat plný text

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning Autor Mio, Matteo, Sarkis, Ralph, Vignudelli, Valeria

“…We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in…”
Získat plný text

Fixed-Points for Quantitative Equational Logics Autor Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“…We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related…”
Získat plný text

The Smash Product of Monoidal Theories Autor Hadzihasanovic, Amar

“…The tensor product of props was defined by Hackney and Robertson as an extension of the Boardman-Vogt product of operads to more general monoidal theories…”
Získat plný text

SLaDe: A Portable Small Language Model Decompiler for Optimized Assembly Autor Armengol-Estape, Jordi, Woodruff, Jackson, Cummins, Chris, O'Boyle, Michael F.P.

“…Decompilation is a well-studied area with numerous high-quality tools available. These are frequently used for security tasks and to port legacy code. However,…”
Získat plný text

Comonadic semantics for guarded fragments Autor Abramsky, Samson, Marsden, Dan

“…In previous work ([1], [2], [3]), it has been shown how a range of model comparison games which play a central role in finite model theory, including…”
Získat plný text

An Algebraic Characterisation of First-Order Logic with Neighbour Autor Manuel, Amaldev, Nevatia, Dhruv

“…We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over…”
Získat plný text

ChipAlign: Instruction Alignment in Large Language Models for Chip Design via Geodesic Interpolation Autor Deng, Chenhui, Bai, Yunsheng, Ren, Haoxing

“…Recent advancements in large language models (LLMs) have expanded their application across various domains, including chip design, where domain-adapted chip…”
Získat plný text

FlashRegex: Deducing Anti-ReDoS Regexes from Examples Autor Li, Yeting, Xu, Zhiwu, Cao, Jialun, Chen, Haiming, Ge, Tingjian, Cheung, Shing-Chi, Zhao, Haoren

“…Regular expressions (regexes) are widely used in different fields of computer science such as programming languages, string processing and databases. However,…”
Získat plný text

Constraint Satisfaction Problems over Finite Structures Autor Barto, Libor, DeMeo, William, Mottet, Antoine

“…We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both…”
Získat plný text

Practical Preprocessing of Logs at Scale Autor Zhao, Jianchen

“…Logs are diverse in structure and large in volume. While containing important information about systems at runtime, they must be preprocessed before analysis…”
Získat plný text

LibreLog: Accurate and Efficient Unsupervised Log Parsing Using Open-Source Large Language Models Autor Ma, Zeyang, Kim, Dong Jae, Chen, Tse-Hsun Peter

“…Log parsing is a critical step that transforms unstructured log data into structured formats, facilitating subsequent log-based analysis. Traditional…”
Získat plný text

Types Are Internal ∞-Groupoids Autor Finster, Eric, Allioux, Antoine, Sozeau, Matthieu

“…By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type…”
Získat plný text