Academic literature on the topic 'Chomsky hierarchy'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Chomsky hierarchy.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Chomsky hierarchy"

1

Paun, Gheorghe. "Controlled H Systems and Chomsky Hierarchy." Fundamenta Informaticae 30, no. 1 (1997): 45–57. http://dx.doi.org/10.3233/fi-1997-30104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jurdzinski, Tomasz, and Krzysztof Lorys. "Leftist Grammars and the Chomsky Hierarchy." Theory of Computing Systems 41, no. 2 (2007): 233–56. http://dx.doi.org/10.1007/s00224-007-2017-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dömösi, Pál, Szilárd Fazekas, and Ito Masami. "On Chomsky Hierarchy of Palindromic Languages." Acta Cybernetica 22, no. 3 (2016): 703–13. http://dx.doi.org/10.14232/actacyb.22.3.2016.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Berstel, Jean, Luc Boasson, and Isabelle Fagnot. "Splicing systems and the Chomsky hierarchy." Theoretical Computer Science 436 (June 2012): 2–22. http://dx.doi.org/10.1016/j.tcs.2012.03.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fachini, Emanuela, and Angelo Monti. "CHOMSKY HIERARCHY AND SYSTOLIC Y-TREE AUTOMATA." Fundamenta Informaticae 29, no. 4 (1997): 325–39. http://dx.doi.org/10.3233/fi-1997-29402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jäger, Gerhard, and James Rogers. "Formal language theory: refining the Chomsky hierarchy." Philosophical Transactions of the Royal Society B: Biological Sciences 367, no. 1598 (2012): 1956–70. http://dx.doi.org/10.1098/rstb.2012.0077.

Full text
Abstract:
The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages).
APA, Harvard, Vancouver, ISO, and other styles
7

Sureshkumar, Williams, and Raghavan Rama. "Chomsky Hierarchy Control on Isotonic Array P Systems." International Journal of Pattern Recognition and Artificial Intelligence 30, no. 02 (2016): 1650004. http://dx.doi.org/10.1142/s021800141650004x.

Full text
Abstract:
In this paper, we propose a new regulated evolution in P systems with isotonic arrays and isotonic array rules. The regulated language will be a language of Chomsky hierarchy. This model generates interesting pictures for a given regulated language. The generative capacity is explored.
APA, Harvard, Vancouver, ISO, and other styles
8

Icard, Thomas F. "Calibrating generative models: The probabilistic Chomsky–Schützenberger hierarchy." Journal of Mathematical Psychology 95 (April 2020): 102308. http://dx.doi.org/10.1016/j.jmp.2019.102308.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

NIVAT, M., A. SAOUDI, and V. R. DARE. "PARALLEL GENERATION OF FINITE IMAGES." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 03n04 (1989): 279–94. http://dx.doi.org/10.1142/s0218001489000243.

Full text
Abstract:
We define a syntactic model for generating sets of images, where an image can be viewed as an array over finite alphabet. This model is called image grammar. Image grammar can be considered as a generalization of classical Chomsky grammar. Then we study some combinatorial and language theoretical properties such as reduction, pumping lemmas, complexity measure, we give a strict infinite hierarchy. We also characterize these families in terms of deterministic substitutions and Chomsky languages.
APA, Harvard, Vancouver, ISO, and other styles
10

Senthil Kumar, K., and D. Malathi. "Context Free Grammar Identification from Positive Samples." International Journal of Engineering & Technology 7, no. 3.12 (2018): 1096. http://dx.doi.org/10.14419/ijet.v7i3.12.17768.

Full text
Abstract:
In grammatical inference one aims to find underlying grammar or automaton which explains the target language in some way. Context free grammar which represents type 2 grammar in Chomsky hierarchy has many applications in Formal Language Theory, pattern recognition, Speech recognition, Machine learning , Compiler design and Genetic engineering etc. Identification of unknown Context Free grammar of the target language from positive examples is an extensive area in Grammatical Inference/ Grammar induction. In this paper we propose a novel method which finds the equivalent Chomsky Normal form.
APA, Harvard, Vancouver, ISO, and other styles
More sources
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography