Ugrás a tartalomhoz

Sablon:formal languages and grammars

A Wikiszótárból, a nyitott szótárból

automata theory: formal languages and formal grammars

Chomsky hierarchy	grammars	languages	abstract machines
type-0 — type-1 — — — — — type-2 — — type-3 — —	unrestricted (no common name) context-sensitive positive range concatenation indexed — linear context-free rewriting systems tree-adjoining context-free deterministic context-free visibly pushdown regular — non-recursive	recursively enumerable decidable context-sensitive positive range concatenation^* indexed^* — linear context-free rewriting language tree-adjoining context-free deterministic context-free visibly pushdown regular star-free finite	turing machine decider linear-bounded ptime turing machine nested stack thread automaton restricted tree stack automaton embedded pushdown nondeterministic pushdown deterministic pushdown visibly pushdown finite counter-free (with aperiodic finite monoid) acyclic finite

each category of languages, except those marked by a ^*, is a proper subset of the category directly above it. any language in each category is generated by a grammar and by an automaton in the category in the same line.

Sablon:navbox documentation

A lap eredeti címe: „https://hu.wiktionary.org/w/index.php?title=Sablon:formal_languages_and_grammars&oldid=3505189”