This HTML5 document contains 38 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n13http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n3http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
n6http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F07%3A00004947%21RIV10-MSM-15310___/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F07%3A00004947%21RIV10-MSM-15310___
rdf:type
n3:Vysledek skos:Concept
dcterms:description
The paper presents a contribution to minimization of fuzzy automata. Traditionally, the problem of minimization of fuzzy automata results directly from the problem of minimization of ordinary automata. That is, given a fuzzy automaton, describe an automaton with the minimal number of states which recognizes the same language as the given one. In this paper, we formulate a different problem. Namely, the minimal fuzzy automaton we are looking for is required to recognize a language which is similar to the language of the given fuzzy automaton to a certain degree a, such as a = 0.9, prescribed by a user. That is, we relax the condition of being equal to a weaker condition of being similar to degree a. The paper presents a contribution to minimization of fuzzy automata. Traditionally, the problem of minimization of fuzzy automata results directly from the problem of minimization of ordinary automata. That is, given a fuzzy automaton, describe an automaton with the minimal number of states which recognizes the same language as the given one. In this paper, we formulate a different problem. Namely, the minimal fuzzy automaton we are looking for is required to recognize a language which is similar to the language of the given fuzzy automaton to a certain degree a, such as a = 0.9, prescribed by a user. That is, we relax the condition of being equal to a weaker condition of being similar to degree a.
dcterms:title
Approximate minimization of fuzzy automata Approximate minimization of fuzzy automata
skos:prefLabel
Approximate minimization of fuzzy automata Approximate minimization of fuzzy automata
skos:notation
RIV/61989592:15310/07:00004947!RIV10-MSM-15310___
n4:aktivita
n5:Z
n4:aktivity
Z(MSM6198959214)
n4:dodaniDat
n12:2010
n4:domaciTvurceVysledku
n9:9623264 n9:4668952
n4:druhVysledku
n18:D
n4:duvernostUdaju
n17:S
n4:entitaPredkladatele
n11:predkladatel
n4:idSjednocenehoVysledku
410599
n4:idVysledku
RIV/61989592:15310/07:00004947
n4:jazykVysledku
n16:eng
n4:klicovaSlova
finite automata; fuzzy logic; minimization
n4:klicoveSlovo
n15:finite%20automata n15:fuzzy%20logic n15:minimization
n4:kontrolniKodProRIV
[97385CF05F2F]
n4:mistoVydani
Singapore
n4:nazevZdroje
Proceedings of the 10th Joint Conference on Information Sciences
n4:obor
n14:BD
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:rokUplatneniVysledku
n12:2007
n4:tvurceVysledku
Krupka, Michal Bělohlávek, Radim
n4:zamer
n6:MSM6198959214
s:numberOfPages
500
n13:hasPublisher
World Scientific Publishing Company
n20:isbn
978-981-270-967-7
n19:organizacniJednotka
15310