Related papers: $q$-Derivative Grammar
We present a deformed algebra related to the q-exponential and the q-logarithm functions that emerge from nonextensive statistical mechanics. We also develop a q-derivative (and consistently a q-integral) for which the q-exponential is an…
We extend the Chomsky/Sch\"utzenberger method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.
Context-free language theory is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formalization, using the Coq proof assistant, of fundamental results related…
Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an…
In this article, we provide three coalgebraic characterizations of the class of context-free languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying output-derivative pairs. Final…
Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…
Context-free languages are widely used to describe the syntax of programming languages and natural languages. Usually, we describe a context-free language mathematically with the help of context-free grammar (for generation) or pushdown…
In this paper we consider the problem of context-free grammars comparison from the analysis point of view. We show that the problem can be reduced to numerical solution of systems of nonlinear matrix equations. The approach presented here…
Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$ a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all words over $A$ that reduce in $G$ to an element of $K$ is a context-free language. When…
To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free…
This is a first of our papers devoted to "noncommutative topology and graph theory". Its origin is the paper math.QA/0002238 by I. Gelfand, V. Retakh, and R.L. Wilson where a new class of noncommutative algebras $Q_n$ was introduced. The…
We introduce a normal form for context-free grammars, called Dyck normal form. This is a syntactical restriction of the Chomsky normal form, in which the two nonterminals occurring on the right-hand side of a rule are paired nonterminals.…
Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different tools are being increasingly used in…
In the present paper, we propose the concepts of weighted differential ($q$-tri)dendriform algebras and give some basic properties of them. The corresponding free objects are constructed, in both the commutative and noncommutative contexts.
We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…
In this paper we introduce a class of noncommutative (finitely generated) monomial algebras whose Hilbert series are algebraic functions. We use the concept of graded homology and the theory of unambiguous context-free grammars for this…
The derivative polynomials introduced by Knuth and Buckholtz in their calculations of the tangent and secant numbers are extended to a multivariable $q$--environment. The $n$-th $q$-derivatives of the classical $q$-tangent and $q$-secant…
In a paper published in Information Processing Letters in 2000, Bouajjani et al. presented an automata-based approach to a number of elementary problems on context-free grammars. This approach is of pedagogical interest since it provides a…
We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…
The theory of $q$-analogs frequently occurs in a number of areas, including the fractals and dynamical systems. The $q$-derivatives and $q$-integrals play a prominent role in the study of $q$-deformed quantum mechanical simple harmonic…