Výsledky vyhľadávania - 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…”
Získať 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…”
Získať 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

“… We have observed that these approaches suffer from low quality and readability, primarily because they process entire example strings, adding to the complexity and substantially slowing down computations…”
Získať plný text

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

“… (star-free expressions = aperiodic languages) result of Schützenberger. Our result also generalizes a lesser known characterization by Schutzenberger of aperiodic languages by SD-regular expressions (SD=AP…”
Získať plný text

Positive First-order Logic on Words Autor Kuperberg, Denis

“… We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO…”
Získať 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ískať plný text

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

“… Often, such behavioural preorders are characterized in terms of theory inclusion in dedicated characteristic logics; e.g…”
Získať 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ískať plný text

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

“… For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are involution semigroups…”
Získať 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ískať 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ískať 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 Ehrenfeucht-Fraïssé…”
Získať 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 which is able to encode a number of fully…”
Získať 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ískať 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.

“… However, they regularly generate difficult-to-read programs and require a large amount of engineering effort to support new programming languages and ISAs…”
Získať plný text

Continuous One-Counter Automata Autor Blondin, Michael, Leys, Tim, Mazowiecki, Filip, Offtermatt, Philip, Perez, Guillermo A.

“…We study the reachability problem for continuous one-counter automata, COCA for short…”
Získať 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 database…”
Získať 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 models like ChipNeMo have emerged…”
Získať 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ískať 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

“… Recently, large language models (LLM) based log parsers have shown superior parsing accuracy…”
Získať plný text