Výsledky vyhľadávania - Theory of computation Formal languages AND automata theory Grammars AND context-free languages

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…”
Získať plný text

Parikh's theorem for infinite alphabets Autor 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…”
Získať plný text

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

Fast Deterministic Black-Box Context-Free Grammar Inference Autor 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…”
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

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

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

Language Equation Solving via Boolean Automata Manipulation Autor 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…”
Získať plný text

Timed Pushdown Automata Revisited Autor 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…”
Získať plný text

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata Autor 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…”
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

Axiomatizations and Computability of Weighted Monadic Second-Order Logic Autor 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…”
Získať plný text

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

“…Kleene algebra axioms are complete with respect to both language models and binary relation models…”
Získať plný text

Input Algebras Autor 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…”
Získať plný text

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection Autor 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…”
Získať plný text

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

“…The algebraic theory of rational languages has provided powerful decidability results…”
Získať plný text

Mining input grammars from dynamic taints Autor 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…”
Získať plný text

ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding Autor 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…”
Získať plný text

From Monadic Second-Order Definable String Transformations to Transducers Autor 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…”
Získať plný text