Deterministic Finite Automaton in PHP

An important area of the theoretical computer science deals with finite automata and languages. We use a finite automaton to detect words of regular languages. The types of grammars that create a language are defined in the CHOMSKY-hierachy (Noam Chomsky). The table below shows the CHOMSKY-hierachy: no. title 0 recursively enumerable 1 context-sensitive 2 context-free […]