Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Group

Rule Matching and Automata Conversion Algorithms

Algorithms that work on networks of rules, patterns or states to decide what matches or what a machine accepts. The Rete algorithm is a pattern matching algorithm for rule-based systems that applies many rules to many facts efficiently and determines which rules should fire, and Kleene's algorithm transforms a nondeterministic finite automaton into a regular expression. An algorithm belongs here when its cited article describes matching rules or patterns over facts, or converting between automata and expressions. It excludes algorithms that search for substrings in text, which sit with the string searching algorithms.

Browse By
Rule Matching and Automata Conversion Algorithms
Filter Results2 entries
Sources
Rete algorithm (Wikipedia)
Has Member: Rete Algorithm, Introduction
Quote, Has Member: Rete Algorithm, Introduction
The Rete algorithm ( REE-tee, RAY-tee, rarely REET, reh-TAY) is a pattern matching algorithm for implementing rule-based systems.
View the Source
Wikipedia: Kleene's algorithm
Has Member: Kleene's Algorithm, Introduction
Quote, Has Member: Kleene's Algorithm, Introduction
In theoretical computer science, in particular in formal language theory, Kleene's algorithm transforms a given nondeterministic finite automaton (NFA) into a regular expression.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.