A further note on top-down deterministic languages | Zendy

D. Wood | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A further note on top-down deterministic languages

Author(s) -

D. Wood

Publication year - 1971

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/14.4.396

Subject(s) - abstract family of languages , equivalence (formal languages) , cone (formal languages) , closure (psychology) , computer science , formal language , separable space , mathematics , context (archaeology) , second generation programming language , relation (database) , ontology language , rule based machine translation , regular language , context free language , ergative case , discrete mathematics , programming language , combinatorics , natural language processing , fifth generation programming language , artificial intelligence , automaton , database , programming paradigm , mathematical analysis , semantic web , biology , paleontology , market economy , transitive relation , economics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research