Statements (101)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic
gptkb:theoretical_computer_science_topic |
| gptkbp:appliesTo |
gptkb:artificial_intelligence
natural language processing compiler design model checking parsing |
| gptkbp:hasConcept |
gptkb:configuration
gptkb:theoretical_computer_science gptkb:Chomsky_hierarchy gptkb:alphabet gptkb:undecidable_problem gptkb:acceptance_condition gptkb:deterministic_finite_automaton gptkb:nondeterministic_finite_automaton gptkb:Moore_machine gptkb:Myhill-Nerode_theorem gptkb:context-free_grammar gptkb:Rabin_automaton gptkb:Muller_automaton gptkb:Mealy_machine gptkb:Büchi_automaton gptkb:Streett_automaton gptkb:parity_automaton gptkb:finite_state_machine context-free language determinism regular language language recognition transition function accept state halting problem regular expressions start state tape decidability universality stack input alphabet nondeterminism state diagram recursively enumerable language regular grammar acceptance by empty stack acceptance by final state acceptance by halting alternating automaton closure properties configuration graph context-sensitive grammar decidable problem deterministic pushdown automaton emptiness problem epsilon transition equivalence problem finite control input string language acceptance language class minimization multi-tape automaton nested word automaton non-accept state non-recursive language nondeterministic pushdown automaton omega automaton output alphabet output function probabilistic automaton pumping lemma quantum automaton read head recognizer recursive language register automaton state transition timed automaton transducer transition system transition table tree automaton two-way automaton unrestricted grammar weighted automaton write head |
| gptkbp:includes |
gptkb:finite_automata
gptkb:pushdown_automata gptkb:linear_bounded_automata cellular automata Turing machines |
| gptkbp:relatedTo |
gptkb:complexity_theory
computability theory formal language theory |
| gptkbp:studies |
formal languages
abstract machines computational problems |
| gptkbp:bfsParent |
gptkb:universal_Turing_machine
gptkb:Formal_languages gptkb:John_E._Hopcroft |
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Automata theory
|