Search Results - Theory of computation Formal languages and automata theory

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

“…Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems…”
Get full text

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

“…We investigate commutative images of languages recognised by register automata and grammars…”
Get full text

Incremental Context-free Grammar Inference in Black Box Settings by 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…”
Get full text

SD-Regular Transducer Expressions for Aperiodic Transformations by 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…”
Get full text

Positive First-order Logic on Words by Kuperberg, Denis

“… We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO…”
Get full text

A Database Dependent Framework for K-Input Maximum Fanout-Free Window Rewriting by 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…”
Get full text

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

“… Often, such behavioural preorders are characterized in terms of theory inclusion in dedicated characteristic logics; e.g…”
Get full text

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning by 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…”
Get full text

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

“… The result is a novel theory of fixed points which can not only provide solutions to the traditional fixed-point equations but we can also define the rate of convergence to the fixed point…”
Get full text

An Algebraic Characterisation of First-Order Logic with Neighbour by 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…”
Get full text

Normalization for Cubical Type Theory by 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…”
Get full text

The Smash Product of Monoidal Theories by 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…”
Get full text

Comonadic semantics for guarded fragments by 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é…”
Get full text

Types Are Internal ∞-Groupoids by 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…”
Get full text

Constraint Satisfaction Problems over Finite Structures by 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…”
Get full text

SLaDe: A Portable Small Language Model Decompiler for Optimized Assembly by 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…”
Get full text

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

“…We study the reachability problem for continuous one-counter automata, COCA for short…”
Get full text

FlashRegex: Deducing Anti-ReDoS Regexes from Examples by 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…”
Get full text

ChipAlign: Instruction Alignment in Large Language Models for Chip Design via Geodesic Interpolation by 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…”
Get full text

Practical Preprocessing of Logs at Scale by 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…”
Get full text