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

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. The…”
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

“…Black-box context-free grammar inference presents a significant challenge in many practical settings due to limited access to example programs. The…”
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

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

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

“…Language equations are a powerful tool for compositional synthesis, modeled as the unknown component problem. Given a (sequential) system specification S and a…”
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. Semi-linear and rational sets can be naturally extended to this…”
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…”
Získať plný text

Positive First-order Logic on Words Autor Kuperberg, Denis

“…We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable…”
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…”
Získať plný text

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

“…FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order…”
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. Its…”
Získať plný text

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

“…We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over…”
Získať plný text

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

“…The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine…”
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. In such automata, transitions are guarded by upper and lower bound tests…”
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. Among them, one of the most fundamental is the definability of a…”
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. In particular, two regular expressions recognise the same…”
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

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

“…Knowing which part of a program processes which parts of an input can reveal the structure of the input as well as the structure of the program. In a URL…”
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

Grammar-Based Action Selection Rules for Scriptless Testing Autor Hufkens, Lianne V., Ricos, Fernando Pastor, Marin, Beatriz, Vos, Tanja E. J.

“…Scriptless testing at the GUI level involves generating test sequences on the fly. These test sequences mimic user interactions on the GUI The creation of…”
Získať plný text