Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Meduna, Alexander" wg kryterium: Autor


Wyświetlanie 1-4 z 4
Tytuł:
On State-Synchronized Automata Systems
Autorzy:
Meduna, Alexander
Kučera, Jiřĭ
Powiązania:
https://bibliotekanauki.pl/articles/1373671.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
pushdown automata
determinism
recursively enumerable languages
state-synchronized automata systems
automata systems
Opis:
In this paper, we introduce a new kind of automata systems, called state-synchronized automata systems of degree $n$. In general, they consists of $n$ pushdown automata, referred to as their components. These systems can perform a computation step provided that the concatenation of the current states of all their components belongs to a prescribed control language. As its main result, the paper demonstrates that these systems characterize the family of recursively enumerable languages. In fact, this characterization is demostrated in both deterministic and nondeterministic versions of these systems. Restricting their components, these systems provides less computational power.
Źródło:
Schedae Informaticae; 2015, 24; 221-237
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Power-Decreasing Derivation Restrictions in Grammar Systems
Autorzy:
Meduna, Alexander
Cermak, Martin
Masopust, Tomas
Powiązania:
https://bibliotekanauki.pl/articles/1373401.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
grammar systems
derivation restriction
generative power
Opis:
In this paper, we place some left restrictions on derivations in CD grammar systems with phrase- structure grammars, controlled by the regular languages. The first restriction requires that every production is always applied within the first k nonterminals in every sentential form, for some $k \ge 1$. The second restriction says how many blocks of non-terminals can be in each sentential form. The third restriction extends the second restriction and says how many blocks of non-terminals with limited length can be in each sentential form. We demonstrate that under these restrictions, the grammar systems generate different families of languages. Indeed, under the first restriction, these systems generate only context-free languages. Under the second restriction, even one-component systems characterize the entire family of recursively enumerable languages. In the end, the family of languages generated by grammar systems under the third restriction is equal to the family of languages generated by programmed grammars with context-free rules without $\epsilon$- rules of nite index.
Źródło:
Schedae Informaticae; 2010, 19; 23-34
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Normal Forms and Erasing Rules in Path Controlled Grammars
Autorzy:
Koutný, Jiří
Meduna, Alexander
Powiązania:
https://bibliotekanauki.pl/articles/1373725.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
context-free grammars
path controlled grammars
restricted derivation trees
paths
normal forms
erasing rules
Opis:
This paper discusses path controlled grammars-context-free gram- mars with a root-to-leaf path in their derivation trees restricted by a control language. First, it investigates the impact of erasing rules on the generative power of path controlled grammars. Then, it establishes two Chomsky-like normal forms for path controlled grammars-the first allows unit rules, the second allows just one erasing rule.
Źródło:
Schedae Informaticae; 2013, 22; 9-18
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New Grammar Systems and Their Application Perspectives
Autorzy:
Horáček, Petr
Meduna, Alexander
Powiązania:
https://bibliotekanauki.pl/articles/1373727.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
synchronous grammars
regulated grammars
transducers
computational control
generative power
natural language translation
Opis:
This paper presents new grammar systems that describe transformations of syntactic structures. They represent two approaches: synchronous grammars and transducers. The systems consist of well-known models such as context-free grammars and finite automata. Particular attention is paid to synchronization of regulated grammars. The paper recalls formal definitions of the systems and discusses theoretical results regarding their generative and accepting power. The last part briefly introduces application perspectives in natural language translation, illustrated by examples of Czech-English translation.
Źródło:
Schedae Informaticae; 2013, 22; 47-68
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies