Suchergebnisse - Theory of computation Formal languages and automata theory Grammars and context-free languages

Theory of Automata, Formal Languages and Computation von Xavier, S.P.E

“… This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages …”
Volltext

Supply Of An Introduction To Automata Theory Formal Languages, An Introduction To Automata Theory, Formal Languages And Computation, Algorithm Design And Analysis, Analysis And Design Of Algorithms, Design Analysis Of Algorithms, Discrete Mathematics

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

“… Black-box context-free grammar inference presents a significant challenge in many practical settings due to limited access to example programs …”
Volltext

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

Parikh's theorem for infinite alphabets von 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 …”
Volltext

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

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

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

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

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

Language Equation Solving via Boolean Automata Manipulation von 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 …”
Volltext

Timed Pushdown Automata Revisited von 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 …”
Volltext

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

Input Algebras von 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 …”
Volltext

Axiomatizations and Computability of Weighted Monadic Second-Order Logic von 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 …”
Volltext

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

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

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection von 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 …”
Volltext

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

“… The algebraic theory of rational languages has provided powerful decidability results …”
Volltext

Mining input grammars from dynamic taints von 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 …”
Volltext