Suchergebnisse - Theory of computation Formal languages and automata theory

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

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

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

“… We investigate commutative images of languages recognised by register automata and grammars …”
Volltext

Incremental Context-free Grammar Inference in Black Box Settings von 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 …”
Volltext

SD-Regular Transducer Expressions for Aperiodic Transformations von 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 …”
Volltext

Positive First-order Logic on Words von Kuperberg, Denis

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

A Database Dependent Framework for K-Input Maximum Fanout-Free Window Rewriting von 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 …”
Volltext

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

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

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning von 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 …”
Volltext

Fixed-Points for Quantitative Equational Logics von 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 …”
Volltext

An Algebraic Characterisation of First-Order Logic with Neighbour von 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 …”
Volltext

Normalization for Cubical Type Theory von 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 …”
Volltext

The Smash Product of Monoidal Theories von 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 …”
Volltext

Comonadic semantics for guarded fragments von 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é …”
Volltext

Types Are Internal ∞-Groupoids von 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 …”
Volltext

Constraint Satisfaction Problems over Finite Structures von 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 …”
Volltext

SLaDe: A Portable Small Language Model Decompiler for Optimized Assembly von 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 …”
Volltext

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

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

FlashRegex: Deducing Anti-ReDoS Regexes from Examples von 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 …”
Volltext

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

Practical Preprocessing of Logs at Scale von 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 …”
Volltext