Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("HIERARCHIE CHOMSKY")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 19 of 19

  • Page / 1
Export

Selection :

  • and

DETERMINISTIC LINDENMAYER LANGUAGES, NONTERMINALS AND HOMOMORPHISMS.VITANYI PMB.1974; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1974; NO 28; PP. 1-55; BIBL. 2 P. 1/2Article

A guide to membrane computingPAUN, Gheorghe; ROZENBERG, Grzegorz.Theoretical computer science. 2002, Vol 287, Num 1, pp 73-100, issn 0304-3975, 28 p.Article

Dynamics and computation in functional shiftsNAMIKAWA, Jun; HASHIMOTO, Takashi.Nonlinearity (Bristol. Print). 2004, Vol 17, Num 4, pp 1317-1336, issn 0951-7715, 20 p.Article

Lower bound technique for length-reducing automataJURDZINSKI, Tomasz; LORYS, Krzysztof.Information and computation (Print). 2007, Vol 205, Num 9, pp 1387-1412, issn 0890-5401, 26 p.Article

On state-alternating context-free grammarsMORIYA, Etsuro; HOFBAUER, Dieter; HUBER, Maria et al.Theoretical computer science. 2005, Vol 337, Num 1-3, pp 183-216, issn 0304-3975, 34 p.Article

Formal properties of PA-matchingKOBAYASHI, Satoshi; MITRANA, Victor; PAUN, Gheorghe et al.Theoretical computer science. 2001, Vol 262, Num 1-2, pp 117-131, issn 0304-3975Article

Characterizations of re languages starting from internal contextual languagesMATEESCU, A; PAUN, G; ROZENBERG, G et al.International journal of computer mathematics. 1998, Vol 66, Num 3-4, pp 179-197, issn 0020-7160Article

Languages generated by iterated idempotencyLEUPOLD, Peter.Theoretical computer science. 2007, Vol 370, Num 1-3, pp 170-185, issn 0304-3975, 16 p.Article

Convex and anti-convex languagesDASSOW, J; MARCUS, S; PAUN, G et al.International journal of computer mathematics. 1998, Vol 69, Num 1-2, pp 1-16, issn 0020-7160Article

S4 enriched multimodal categorial grammars are context-freePLUMMER, Andrew R.Theoretical computer science. 2007, Vol 388, Num 1-3, pp 173-180, issn 0304-3975, 8 p.Article

On three variants of rewriting P systemsFERRETTI, Claudio; MAURI, Giancarlo; PAUN, Gheorghe et al.Theoretical computer science. 2003, Vol 301, Num 1-3, pp 201-215, issn 0304-3975, 15 p.Article

Morphic characterizations of languages in Chomsky hierarchy with insertion and localityFUJIOKA, Kaoru.Information and computation (Print). 2011, Vol 209, Num 3, pp 397-408, issn 0890-5401, 12 p.Conference Paper

On differentiation functions, structure functions, and related languages of context-free grammarsDASSOW, Jürgen; MITRANA, Victor; PAUN, Gheorghe et al.Informatique théorique et applications (Imprimé). 2004, Vol 38, Num 3, pp 257-267, issn 0988-3754, 11 p.Article

Left-forbidding cooperating distributed grammar systemsGOLDEFUS, Filip; MASOPUST, Tomáš; MEDUNA, Alexander et al.Theoretical computer science. 2010, Vol 411, Num 40-42, pp 3661-3667, issn 0304-3975, 7 p.Article

On the language equivalence of NE star-patternsNAGY, Benedek.Information processing letters. 2005, Vol 95, Num 3, pp 396-400, issn 0020-0190, 5 p.Article

Descriptional and computational complexity of finite automata—A surveyHOLZER, Markus; KUTRIB, Martin.Information and computation (Print). 2011, Vol 209, Num 3, pp 456-470, issn 0890-5401, 15 p.Conference Paper

Tissue P systemsMARTIN-VIDE, Carlos; PAUN, Gheorghe; PAZOS, Juan et al.Theoretical computer science. 2003, Vol 296, Num 2, pp 295-326, issn 0304-3975, 32 p.Conference Paper

McNaughton families of languagesBEAUDRY, M; HOLZER, M; NIEMANN, G et al.Theoretical computer science. 2003, Vol 290, Num 3, pp 1581-1628, issn 0304-3975, 48 p.Article

Finite graph automata for linear and boundary graph languagesBRANDENBURG, F. J; SKODINIS, K.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 199-232, issn 0304-3975, 34 p.Article

  • Page / 1