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)
Title	On the gap-complexity of simple RL-automata On the gap-complexity of simple RL-automata (en)
skos:prefLabel	On the gap-complexity of simple RL-automata On the gap-complexity of simple RL-automata (en)
skos:notation	RIV/00216208:11320/06:00206167!RIV10-GA0-11320___
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...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Mráz, František Plátek, Martin
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	490457
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/06:00206167
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 simple RL-automata
http://linked.open...ontrolniKodProRIV	[9A18C31DFFA5]
http://linked.open...v/mistoKonaniAkce	Berlin
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Developments in Language Theory
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...iv/tvurceVysledku	Mráz, František Otto, Friedrich Plátek, Martin
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000239454100009
http://linked.open.../riv/zahajeniAkce	2006-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-540-35428-4
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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software