Pattern matching is a powerful tool for symbolic computations, based on the well-defined theory of term rewriting systems. Application domains include algebraic expressions, abstract syntax trees, and XML and JSON data. Unfortunately, no lightweight implementation of pattern matching as general and flexible as Mathematica exists for Python [Pö16], [Hao14], [Sch14], [Jen15]. Therefore, we create...

We present a method to reduce the [FORMULA: SEE TEXT] dynamics of coupled map lattices (CMLs) of N invertibly coupled unimodal maps to a sequence of N-bit symbols. We claim that the symbolic description is complete and provides for the identification of all fixed points, periodic orbits, and dense orbits as well as an efficient representation for studying pattern formation in CMLs. We give our ...

This paper presents a new approach to Automatic Test Pattern Generation for sequential circuits. Traditional topological algorithms nowadays are able to deal with very large circuits, but often fail when highly sequential subnetworks are found. On the other hand, symbolic techniques based on Binary Decision Diagrams proved themselves very efficient on small or medium circuits, no matter their s...

Although basic numerical skills have been widely studied in the last years, very few studies have undertaken a developmental approach. The present study evaluated the development of the magnitude comparison basic numerical ability, in children from first, third and sixth grades by means of the subject's response time in numerical tasks presented in symbolic and non-symbolic formats. The results...

in this work g'/g-expansion method has been employed to solve (2+1)-dimensional dispersive long wave equation. it is shown that g'/g-expansion method, with the help of symbolic computation, provides a very effective and powerful mathematical tool, for solving this equation.

In this paper we evaluate a symbolic loop bound generation technique recently proposed by the authors in [7]. The technique deploys pattern-based recurrence solving in conjunction with program flow refinement using SMT reasoning. The derived bounds are further used in the WCET analysis of programs with loops. This paper presents experimental evaluations of the method carried out with the r-TuBo...

one of the distinctive manifestations of odes at age of is jahelid is depiction and description of ridding animal for the jahelid arabic man in general and camel in particular, that is friend, attendant and associate for the poet and apparently by allusive borrowing from limbs of symbolic animals like zebra, ox and ostrich etc he/ she has sparsely illustrated it. unlike the technique adapted by...

I introduce an innovative methodology for deriving numerical models of systems of partial differential equations which exhibit the evolution of spatial patterns. The new approach directly produces a discretisation for the evolution of the pattern amplitude, has the rigorous support of centre manifold theory at finite grid size h, and naturally incorporates physical boundaries. The results prese...

Mathematica is a symbolic programming language that empowers the user to undertake complicated algebraic tasks. One such task is the derivation of maximum likelihood estimators, demonstrably an important topic in statistics at both the research and the expository level. In this paper, a Mathematica package is provided that contains a function entitled SuperLog. This function utilizes pattern-ma...

Inductive learning is the method of learning from observations. Inductive learning has important applications over a wide range of area including pattern recognition, language acquisition, bio-informatics and intelligent agent design. Because of such diverse applicability, inductive learning methods including automata learning, grammar induction, hidden markov model learning and symbolic statis...