Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical solutions of differential equations --- Measure theory. Mathematical integration --- Volterra equations --- Numerical solutions --- 517.96 --- -519.6 --- 681.3*G19 --- 681.3*N4 --- Equations, Volterra --- Integral equations --- Finite differences. Functional and integral equations --- Computational mathematics. Numerical analysis. Computer programming --- Integral equations: Fredholm equations; integro-differential equations; Volterra equations (Numerical analysis) --- Computerwetenschap--?*N4 --- 681.3*G19 Integral equations: Fredholm equations; integro-differential equations; Volterra equations (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 517.96 Finite differences. Functional and integral equations --- 519.6 --- Numerical analysis --- Volterra equations - Numerical solutions

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Formal languages --- Machine theory --- 681.3*F41 --- 681.3*F42 --- 681.3*F43 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Formalization (Linguistics) --- Language and languages --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- Formal languages. --- Machine theory. --- 681.3*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31}