Statements (69)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic
gptkb:logic |
| gptkbp:appliesTo |
gptkb:artificial_intelligence
gptkb:programming_language natural language processing compiler design |
| gptkbp:concerns |
automata
computational complexity grammars classification of languages syntax of languages |
| gptkbp:field |
gptkb:theoretical_computer_science
gptkb:mathematics |
| gptkbp:hasConcept |
gptkb:alphabet
gptkb:language gptkb:finite_automaton gptkb:syntax gptkb:Kleene_star gptkb:Technical_Machine gptkb:string gptkb:intersection gptkb:Myhill-Nerode_theorem gptkb:context-free_grammar gptkb:finite_state_machine gptkb:nondeterministic_automaton gptkb:Union ambiguity homomorphism language recognition pushdown automaton normal form decidability lexical analysis derivation syntax analysis regular grammar production rule acceptor complement concatenation language generation parse tree context-sensitive grammar language class minimization pumping lemma recognizer unrestricted grammar closure property language equivalence language operation parse algorithm regular expression empty language epsilon (empty string) deterministic automaton language decision problem language hierarchy language membership problem |
| gptkbp:relatedTo |
gptkb:Chomsky_hierarchy
automata theory context-free languages context-sensitive languages recursively enumerable languages regular languages |
| gptkbp:studies |
formal languages
|
| gptkbp:bfsParent |
gptkb:Solomon_Marcus
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Theory of formal languages
|