About: On the state complexity of the reverse of R- and J-trivial regular languages

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

About: On the state complexity of the reverse of R- and J-trivial regular languages 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 tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J-trivial regular language over an (n-2)-element alphabet. We provide a characterization of tight bounds for R-trivial regular languages depending on the state complexity of the language and the size of its alphabet. We show the tight bound for J-trivial regular languages over an (n-2)-element alphabet and a few tight bounds for binary J-trivial regular languages. The case of J-trivial regular languages over an (n-k)-element alphabet, for 2. The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J-trivial regular language over an (n-2)-element alphabet. We provide a characterization of tight bounds for R-trivial regular languages depending on the state complexity of the language and the size of its alphabet. We show the tight bound for J-trivial regular languages over an (n-2)-element alphabet and a few tight bounds for binary J-trivial regular languages. The case of J-trivial regular languages over an (n-k)-element alphabet, for 2. (en)
Title	On the state complexity of the reverse of R- and J-trivial regular languages On the state complexity of the reverse of R- and J-trivial regular languages (en)
skos:prefLabel	On the state complexity of the reverse of R- and J-trivial regular languages On the state complexity of the reverse of R- and J-trivial regular languages (en)
skos:notation	RIV/67985840:_____/13:00394009!RIV14-GA0-67985840
http://linked.open...avai/predkladatel	Matematický ústav AV ČR, v. v. i.
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GPP202/11/P028)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Masopust, Tomáš
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	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	93970
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/13:00394009
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	state complexity; reverse; subregular languages (en)
http://linked.open.../riv/klicoveSlovo	state complexity reverse subregular languages
http://linked.open...ontrolniKodProRIV	[C93AC6CD21DD]
http://linked.open...v/mistoKonaniAkce	London
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Descriptional Complexity of Formal Systems 2013
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Decentralized and coordination supervisory control
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Jirásková, G. Masopust, Tomáš
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-07-22 (xsd:date)
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-39310-5_14
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-39309-9

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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software