Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
formal language theory
theoretical computer science |
| gptkbp:component |
gptkb:Titan
gptkb:alphabet production rules |
| gptkbp:defines |
A Post normal system is a type of string rewriting system defined by a finite set of production rules.
|
| gptkbp:equivalentTo |
gptkb:lambda_calculus
Technical Machine |
| gptkbp:field |
gptkb:logic
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Post normal systems
|
| gptkbp:introduced |
gptkb:Emil_Post
|
| gptkbp:introducedIn |
1943
|
| gptkbp:namedAfter |
gptkb:Emil_Post
|
| gptkbp:relatedTo |
computability theory
formal systems rewriting systems |
| gptkbp:usedFor |
studying computability
studying decision problems studying formal languages |
| gptkbp:bfsParent |
gptkb:Emil_Post
|
| gptkbp:bfsLayer |
5
|