About: Rule-restricted automaton-grammar tranduscers: Power and linguistic applications

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Rule-restricted automaton-grammar tranduscers: Power and linguistic applications Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://ma.fme.vutbr.cz/archiv/1_1/13_35.pdf
Description	This paper introduces the notion of a new transducer as a two-component system, which consists of a finite automaton and a context-free grammar. In essence, while the automaton reads its input string, the grammar produces its output string, and their cooperation is controlled by a set, which restricts the usage of their rules. From a theoretical viewpoint, the present paper discusses the power of this system working in an ordinary way as well as in a leftmost way. In addition, the paper introduces an appearance checking, which allows us to check whether some symbols are present in the rewritten string, and studies its effect on the power. It achieves the following three main results. First, the system generates and accepts languages defined by matrix grammars and partially blind multi-counter automata, respectively. Second, if we place a leftmost restriction on derivation in the context-free grammar, both accepting and generating power of the system is equal to generative power of context- This paper introduces the notion of a new transducer as a two-component system, which consists of a finite automaton and a context-free grammar. In essence, while the automaton reads its input string, the grammar produces its output string, and their cooperation is controlled by a set, which restricts the usage of their rules. From a theoretical viewpoint, the present paper discusses the power of this system working in an ordinary way as well as in a leftmost way. In addition, the paper introduces an appearance checking, which allows us to check whether some symbols are present in the rewritten string, and studies its effect on the power. It achieves the following three main results. First, the system generates and accepts languages defined by matrix grammars and partially blind multi-counter automata, respectively. Second, if we place a leftmost restriction on derivation in the context-free grammar, both accepting and generating power of the system is equal to generative power of context- (en)
Title	Rule-restricted automaton-grammar tranduscers: Power and linguistic applications Rule-restricted automaton-grammar tranduscers: Power and linguistic applications (en)
skos:prefLabel	Rule-restricted automaton-grammar tranduscers: Power and linguistic applications Rule-restricted automaton-grammar tranduscers: Power and linguistic applications (en)
skos:notation	RIV/00216305:26230/12:PU101769!RIV13-MSM-26230___
http://linked.open...avai/predkladatel	Fakulta informačních technologií
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(MEB041003), S, Z(MSM0021630528)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Meduna, Alexandr Čermák, Martin Horáček, Petr
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	166520
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/12:PU101769
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	n-languages, transducer, computational control (en)
http://linked.open.../riv/klicoveSlovo	transducer computational control n-languages
http://linked.open...odStatuVydavatele	CZ - Česká republika
http://linked.open...ontrolniKodProRIV	[81C3F67AD722]
http://linked.open...i/riv/nazevZdroje	Mathematics for applications
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Context-free languages and pushdown automata
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	1
http://linked.open...iv/tvurceVysledku	Horáček, Petr Meduna, Alexandr Čermák, Martin
http://linked.open...n/vavai/riv/zamer	Výzkum informačních technologií z hlediska bezpečnosti
issn	1805-3610
number of pages	22 (xsd:int)
http://localhost/t...ganizacniJednotka	26230
is http://linked.open...avai/riv/vysledek of	Rule-restricted automaton-grammar tranduscers: Power and linguistic applications

Faceted Search & Find service v1.16.116 as of Feb 22 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3239 as of Feb 22 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 81 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software