About: On Minimalism of Analysis by Reduction by Restarting Automata

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

About: On Minimalism of Analysis by Reduction by Restarting 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	The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and shift operations (DSautomata). Four types of (in)finite sets defined by these automata are considered as linguistically relevant: basic languages on word forms marked with grammatical categories, proper languages on unmarked word forms, categorial languages on grammatical categories, and sets of reductions (reduction languages). The equivalence of proper languages is considered for a weak equivalence of DS-automata, and the equivalence of reduction languages for a strong equivalence of DS-automata. The complexity of a language is naturally measured by the number of pebbles, the number of deletions, and the number of word order shifts used in a single reduction step. We have obtained unbounded hierarchies (scales) for all four types of classes of finite lan The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and shift operations (DSautomata). Four types of (in)finite sets defined by these automata are considered as linguistically relevant: basic languages on word forms marked with grammatical categories, proper languages on unmarked word forms, categorial languages on grammatical categories, and sets of reductions (reduction languages). The equivalence of proper languages is considered for a weak equivalence of DS-automata, and the equivalence of reduction languages for a strong equivalence of DS-automata. The complexity of a language is naturally measured by the number of pebbles, the number of deletions, and the number of word order shifts used in a single reduction step. We have obtained unbounded hierarchies (scales) for all four types of classes of finite lan (en)
Title	On Minimalism of Analysis by Reduction by Restarting Automata On Minimalism of Analysis by Reduction by Restarting Automata (en)
skos:prefLabel	On Minimalism of Analysis by Reduction by Restarting Automata On Minimalism of Analysis by Reduction by Restarting Automata (en)
skos:notation	RIV/00216208:11320/14:10289402!RIV15-MSM-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GAP103/10/0783), P(GAP202/10/1333)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Lopatková, Markéta 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	34323
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10289402
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	automata; restarting; reduction; analysis; minimalism (en)
http://linked.open.../riv/klicoveSlovo	automata analysis reduction restarting minimalism
http://linked.open...ontrolniKodProRIV	[0E7B612E9971]
http://linked.open...v/mistoKonaniAkce	Tübingen, Germany
http://linked.open...i/riv/mistoVydani	Heidelberg, Germany
http://linked.open...i/riv/nazevZdroje	19th International Conference on Formal Grammar 2014
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning Structure and its impact for recognition
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Lopatková, Markéta Pardubská, Dana Plátek, Martin
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-08-16 (xsd:date)
number of pages	16 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-662-44121-3
http://localhost/t...ganizacniJednotka	11320

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