Find link

language:

Find link is a tool written by Edward Betts.

searching for Equivalence problem 29 found (32 total)

Knot theory (6,292 words) [view diff] no match in snippet view article find links to article

In topology, knot theory is the study of mathematical knots. While inspired by knots which appear in daily life, such as those in shoelaces and rope, a

Deterministic pushdown automaton (1,236 words) [view diff] exact match in snippet view article find links to article

not for general PDA). Géraud Sénizergues (1997) proved that the equivalence problem for deterministic PDA (i.e. given two deterministic PDA A and B,

Classification theorem (650 words) [view diff] exact match in snippet view article find links to article

class. A few issues related to classification are the following. The equivalence problem is "given two objects, determine if they are equivalent". A complete

Cartan's equivalence method (1,252 words) [view diff] exact match in snippet view article find links to article

the G-structure on N pulls back to the given G-structure on M. An equivalence problem has been "solved" if one can give a complete set of structural invariants

Circuits over sets of natural numbers (1,120 words) [view diff] exact match in snippet view article find links to article

the circuit or tree; the value of n is assumed to be fixed. The equivalence problem asks if, given two gates of a circuit, they evaluate to the same

Degrees of freedom problem (3,545 words) [view diff] exact match in snippet view article find links to article

neuroscience and motor control, the degrees of freedom problem or motor equivalence problem states that there are multiple ways for humans or animals to perform

Whitehead's algorithm (4,869 words) [view diff] exact match in snippet view article find links to article

mathematical algorithm in group theory for solving the automorphic equivalence problem in the finite rank free group Fn. The algorithm is based on a classic

Juhani Karhumäki (362 words) [view diff] exact match in snippet view article find links to article

words. In 1991, jointly with Tero Harju, he solved the long-standing equivalence problem for multitape finite automata in automata theory. Karhumäki contributed

Géraud Sénizergues (243 words) [view diff] exact match in snippet view article find links to article

Pierpaolo; Gorrieri, Roberto; Marchetti-Spaccamela, Alberto (eds.). "The equivalence problem for deterministic pushdown automata is decidable". Automata, Languages

EXPSPACE (648 words) [view diff] exact match in snippet view article find links to article

Ackermann-complete. Game complexity Meyer, A.R. and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space

Albert R. Meyer (394 words) [view diff] exact match in snippet view article find links to article

Szolovits) MIT Press. Meyer, Albert R.; Stockmeyer, Larry J. (1972). "The equivalence problem for regular expressions with squaring requires exponential space"

Dickey–Fuller test (1,349 words) [view diff] no match in snippet view article find links to article

\delta } is close to zero). This is called the "near observation equivalence" problem. The intuition behind the test is as follows. If the series y {\displaystyle

Elwin Bruno Christoffel (1,148 words) [view diff] exact match in snippet view article find links to article

contributions to differential geometry. In a famous 1869 paper on the equivalence problem for differential forms in n variables, published in Crelle's Journal

Paulette Libermann (744 words) [view diff] exact match in snippet view article find links to article

problème d’équivalence de certaines structures infinitésimales [On the equivalence problem of certain infinitesimal structures], under the supervision of Charles

Larry Stockmeyer (545 words) [view diff] exact match in snippet view article find links to article

S2CID 16558679. Meyer, Albert R.; Stockmeyer, Larry J. (1972), "The equivalence problem for regular expressions with squaring requires exponential space"

Niky Kamran (382 words) [view diff] exact match in snippet view article find links to article

mathematics prize of its annual competition for a memoir on the equivalence problem of Élie Cartan and its applications. 2014 CRM - Fields - PIMS Prize

Peter Thullen (359 words) [view diff] exact match in snippet view article find links to article

1007/bf01457933, S2CID 121072397 Sunada, Toshikazu (1978), "Holomorphic equivalence problem for bounded Reinhaldt domains", Mathematische Annalen, 235 (2): 111–128

Toshikazu Sunada (1,029 words) [view diff] exact match in snippet view article find links to article

graph, quantum ergodicity, quantum walk. T. Sunada, Holomorphic equivalence problem for bounded Reinhardt domains, Mathematische Annalen 235 (1978),

List of undecidable problems (1,586 words) [view diff] exact match in snippet view article find links to article

determining: whether two functions are equal, known as the zero-equivalence problem (see Richardson's theorem); the zeroes of a function; whether the

Regular language (3,420 words) [view diff] case mismatch in snippet view article find links to article

Theorem 13.15, p.351 A.R. Meyer & L.J. Stockmeyer (Oct 1972). The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space

Polynomial hierarchy (2,826 words) [view diff] case mismatch in snippet view article find links to article

7, "Proof of theorem 1.9" A. R. Meyer and L. J. Stockmeyer. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space

Alternating finite automaton (808 words) [view diff] exact match in snippet view article find links to article

the complement of the language of an input AFA empty?), and the equivalence problem (do two input AFAs recognize the same language) are PSPACE-complete

G-structure on a manifold (2,576 words) [view diff] exact match in snippet view article find links to article

G-structures. In this view, the general procedure for solving an equivalence problem is to construct a system of invariants for the G-structure which

Hermite normal form (1,849 words) [view diff] exact match in snippet view article find links to article

form must be used. Given two bases for a lattice, A and A', the equivalence problem is to decide if L A = L A ′ . {\displaystyle L_{A}=L_{A'}.} This

Finite-state transducer (2,547 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-3-642-53554-3. Griffiths, T. V. (1968). "The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines". Journal of the

LOOP (programming language) (2,096 words) [view diff] case mismatch in snippet view article

ISBN 978-3-8274-1824-1. DNB 986529222. Tsichritzis, Dennis C (1970). "The Equivalence Problem of Simple Programs". Journal of the ACM. 17 (4): 729–738. doi:10

Nondeterministic finite automaton (4,499 words) [view diff] exact match in snippet view article find links to article

Historically shown in: Meyer, A. R.; Stockmeyer, L. J. (1972-10-25). "The equivalence problem for regular expressions with squaring requires exponential space"

CR manifold (5,630 words) [view diff] exact match in snippet view article find links to article

and studied by Sidney M. Webster in his thesis on the study of the equivalence problem and independently also defined and studied by Tanaka. Accounts of

Function of several complex variables (17,688 words) [view diff] exact match in snippet view article find links to article

1007/bf01457933. S2CID 121072397. Sunada, Toshikazu (1978). "Holomorphic equivalence problem for bounded Reinhardt domains". Mathematische Annalen. 235 (2): 111–128