PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Syllabic Languages and Go-through Automata
Dinu L.P., Gramatovici R., Manea F.
Fundamenta Informaticae
|
2014
|
Vol. 131, nr 3-4
409--424
EN
In this paper we define a new class of contextual grammars and study how the languages generated by such grammars can be accepted by go-through automata. The newly introduced class of grammars is a generalization of the formalism previously used to describe the linguistic process of syllabification. Go-through automata which are used here to recognize, and also parse, the languages generated by this new class of grammars are generalizations of push-down automata in the area of context-sensitivity; they have been proved to be an efficient tool for the recognition of languages generated by contextual grammars. The main results of the paper show how the newly introduced generative model is related with other classes of Marcus contextual languages, and how syllabic languages are recognized and parsed using go-through automata.
2
Content available remote Parsing Local Internal Contextual Languages with Context-Free Choice
Gramatovici R., Manea F.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
171-183
EN
We extend the result from [8] by giving also a concrete polynomial parsing algorithm for a class of languages generated by a variant of contextual grammars, namely local internal contextual grammars with context-free choice.
3
Content available remote On Total Contextual Grammars with Restricted Choice
Ceterchi R., Gramatovici R.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
79-91
EN
A variant of contextual grammars, namely the total contextual grammar with restricted choice, is studied from several points of view. The results obtained by comparing this concept with other related types of contextual grammars support the claim that total contextual grammars with restricted choice are a generative model with good enough qualities for applications in the field of computational linguistics.
4
Content available remote Tissue-like P Systems with Active Membranes for Picture Generation
Ceterchi R., Gramatovici R., Jonoska N., Subramanian K.G.
Fundamenta Informaticae
|
2003
|
Vol. 56, nr 4
311-328
EN
We propose a variant of tissue-like P systems with symport rules and active membranes that generates two-dimensional picture languages. The method is unconventional in that, instead of using the membranes as regions for computation/writing, it uses them to hold elements of pictures. Thus, the picture itself, and actually the whole supporting rectangular grid, is composed of membranes, each one containing (among other symbols) a letter of the picture's alphabet. The method is illustrated by its application to the generation of local and recognizable picture languages.
5
Content available remote An efficient parser for class of contextual languages
Gramatovici R.
Fundamenta Informaticae
|
1998
|
Vol. 33, nr 3
211-238
EN
A class of Marcus contextual languages containing non-context-free languages is defined. A parser for this class of languages is developed. The parser uses an operatorial automaton and it works in square time in the length of the input words.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.