M8170 Computer algebra

Faculty of Science
Spring 2001
Extent and Intensity
2/0/0. 4 credit(s). Type of Completion: zk (examination).
Teacher(s)
doc. RNDr. Josef Niederle, CSc. (lecturer)
Guaranteed by
doc. RNDr. Josef Niederle, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: doc. RNDr. Josef Niederle, CSc.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
  • Mathematics (programme PřF, M-MA, specialization Discrete Mathematics)
  • Mathematics (programme PřF, N-MA, specialization Discrete Mathematics)
Course objectives
Term rewriting systems
Confluent reductions
Church-Rosser property
Termination
Unification algorithm
Critical pairs
Superposition algorithm
Knuth and Bendix completing procedure
Examples
Literature
  • Computer algebra :symbolic and algebraic computation. Edited by Bruno Buchberger. Moskva: Mir, 1986, 392 s. info
  • KNUTH, Donald Ervin. The art of computer programming. Reading: Addison-Wesley Publishing Company, 1969, xi, 624. info
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
The course is also listed under the following terms Spring 2011 - only for the accreditation, Spring 2003, Spring 2005, Spring 2007, Spring 2009, Spring 2011, Spring 2013, Spring 2015, Spring 2017, Spring 2019, Spring 2021, Spring 2023, Spring 2025.
  • Enrolment Statistics (Spring 2001, recent)
  • Permalink: https://is.muni.cz/course/sci/spring2001/M8170