<--- Back to Details
First PageDocument Content
Mathematics / Chomsky hierarchy / Formal grammar / Regular language / Context-free grammar / Context-sensitive grammar / Automata theory / Deterministic finite automaton / Linear grammar / Formal languages / Theoretical computer science / Logic
Date: 2006-02-27 18:05:32
Mathematics
Chomsky hierarchy
Formal grammar
Regular language
Context-free grammar
Context-sensitive grammar
Automata theory
Deterministic finite automaton
Linear grammar
Formal languages
Theoretical computer science
Logic

Add to Reading List

Source URL: dingo.sbs.arizona.edu

Download Document from Source Website

File Size: 221,70 KB

Share Document on Facebook

Similar Documents

Formal languages / Grammar / Language / Cognitive science / Formal grammar / Context-sensitive grammar / Tree-adjoining grammar / Context-free grammar / Regular tree grammar / Tree automaton / Regular language / Graph rewriting

24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.)

DocID: 1rsDZ - View Document

Formal languages / Grammar / Language / Cognitive science / Formal grammar / Noncontracting grammar / Regular language / Chomsky hierarchy / Context-free language / LL grammar / Indexed grammar / Context-sensitive grammar

1 Chomsky Hierarchy Grammars for each task

DocID: 1rf0u - View Document

Formal languages / Grammar / Cognitive science / Language / Context-sensitive grammar / Context-free grammar / Regular language / Formal grammar / Context-free language / Linear grammar / Chomsky hierarchy / Indexed grammar

Towards more complex grammar systems Some basic formal language theory

DocID: 1qSb7 - View Document

Formal languages / Symbol / Context-sensitive grammar / Determinacy / Generalised Whitehead product

CONSENSUS GAME ACCEPTORS AND ITERATED TRANSDUCTIONS DIETMAR BERWANGER AND MARIE VAN DEN BOGAARD LSV, CNRS and Universit´e Paris-Saclay, France Abstract. We study a game for recognising formal languages, in which

DocID: 1qMOd - View Document

Formal languages / Combinatorics / Mathematics / Language / Pattern language / Context-sensitive grammar / Regular language / String / Regular grammar / Context-free grammar / Formal grammar / Kleene star

Formal Grammars and Languages 1 Tao Jiang

DocID: 1qE1D - View Document