About: On the Gap-Complexity of Simple RL-Automata

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

About: On the Gap-Complexity of Simple RL-Automata 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
Description	Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we introduce and study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-sRL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-sRL-automata with an unbounded number of gaps accept NP-complete languages. Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we introduce and study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-sRL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-sRL-automata with an unbounded number of gaps accept NP-complete languages. (en) Redukční analýza je metodou používanou v lingvistice pro kontrolu správnosti vět přirozených jazyků. Tato metoda je modelována pomocí restartovacích automatů. Zde se zavádí a studuje nový typ restartovacích automatů, tak zvaný t-sRL-automat, jenž je RL-automatem s pracovním oknem velikosti 1, a který splňuje podmínku minimální acceptance. Na druhé straně, může provádět až vypouštěcích kroků v cyklu. Zde studujeme tzv. gap-complexity těchto automatů. Membership problém pro jazyky přijímané pomocí t-sRL-automatů s omezeným počtem děr (gaps) je řešitelný v polynomiálním čase. Na druhé straně, t-sRL-automaty neomezeým počtem děr přijímají NP-úplné jazyky. (cs)
Title	On the Gap-Complexity of Simple RL-Automata O děrové-složitosti jednoduchých RL- automatů (cs) On the Gap-Complexity of Simple RL-Automata (en)
skos:prefLabel	On the Gap-Complexity of Simple RL-Automata O děrové-složitosti jednoduchých RL- automatů (cs) On the Gap-Complexity of Simple RL-Automata (en)
skos:notation	RIV/00216208:11320/06:00002821!RIV07-GA0-11320___
http://linked.open.../vavai/riv/strany	83;94
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET100300517), P(GA201/04/2102), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika	4036
http://linked.open...vai/riv/dodaniDat	2007
http://linked.open...aciTvurceVysledku	Mráz, František Plátek, Martin
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	490458
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/06:00002821
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Gap-Complexity; Simple; RL-Automata (en)
http://linked.open.../riv/klicoveSlovo	Gap-Complexity RL-Automata Simple
http://linked.open...odStatuVydavatele	CZ - Česká republika
http://linked.open...ontrolniKodProRIV	[FB020F99D7FE]
http://linked.open...i/riv/nazevZdroje	Lecture Notes In Computer Science
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing Intelligent Information Retrieval
http://linked.open...UplatneniVysledku	2006
http://linked.open...v/svazekPeriodika	4036/2006
http://linked.open...iv/tvurceVysledku	Mráz, František Plátek, Martin
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	0302-9743
number of pages	12 (xsd:int)
http://localhost/t...ganizacniJednotka	11320
is http://linked.open...avai/riv/vysledek of	On the Gap-Complexity of Simple RL-Automata On the Gap-Complexity of Simple RL-Automata

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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