Search Results - Theory of computation Formal languages AND automata theory Grammars AND context-free languages~

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

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

“… We also lift the latter result to grammars: commutative images of one- register context-free languages are rational, and in consequence commutatively equivalent to register automata…”
Get full text

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

Fast Deterministic Black-Box Context-Free Grammar Inference by Arefin, Mohammad Rifat, Shetiya, Suraj, Wang, Zili, Csallner, Christoph

“…Black-box context-free grammar inference is a hard problem as in many practical settings it only has access to a limited number of example programs…”
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

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

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

Language Equation Solving via Boolean Automata Manipulation by Lin, Wan-Hsuan, Su, Chia-Hsuan, Jiang, Jie-Hong R.

“… S. The synthesis of X can be formulated with language equation solving. Although prior work exploits partitioned representation for effective finite automata manipulation…”
Get full text

Timed Pushdown Automata Revisited by Clemente, Lorenzo, Lasota, Slawomir

“…This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. Collapses…”
Get full text

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata by Burjons, Elisabet, Frei, Fabian, Raszyk, Martin

“… In this paper, we examine the analogous problem for finite transducers and automata. Every nondeterministic finite transducer defines a binary relation associating each…”
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

Axiomatizations and Computability of Weighted Monadic Second-Order Logic by Achilleos, Antonis, Pedersen, Mathias Ruggaard

“…Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata…”
Get full text

Petri Automata for Kleene Allegories by Brunet, Paul, Pous, Damien

“…Kleene algebra axioms are complete with respect to both language models and binary relation models…”
Get full text

Input Algebras by Gopinath, Rahul, Nemati, Hamed, Zeller, Andreas

“…Grammar-based test generators are highly efficient in producing syntactically valid test inputs, and give their user precise control over which test inputs should be generated…”
Get full text

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection by Carayol, A., Serre, O.

“…Higher-order recursion schemes are rewriting systems for simply typed terms and they are known to be equi-expressive with collapsible pushdown automata (CPDA…”
Get full text

First-order definability of rational transductions: An algebraic approach by Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan

“…The algebraic theory of rational languages has provided powerful decidability results…”
Get full text

Mining input grammars from dynamic taints by Hoschele, Matthias, Zeller, Andreas

“… The result is a context-free grammar that reflects valid input structure. In its evaluation, our AUTOGRAM prototype automatically produced readable and structurally accurate grammars for inputs like URLs, spreadsheets or configuration files. The resulting grammars not only allow simple reverse engineering of input formats, but can also directly serve as input for test generators…”
Get full text

ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding by Zhong, Shuzhang, Yang, Zebin, Gong, Ruihao, Wang, Runsheng, Huang, Ru, Li, Meng

“…Recent advancements in generative large language models (LLMs) have significantly boosted the performance in natural language processing tasks…”
Get full text

From Monadic Second-Order Definable String Transformations to Transducers by Alur, Rajeev, Durand-Gasselin, Antoine, Trivedi, Ashutosh

“…Courcelle (1992) proposed the idea of using logic, in particular Monadic second-order logic (MSO), to define graph to graph transformations. Transducers, on…”
Get full text