This HTML5 document contains 45 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/
n12http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F14%3APU111904%21RIV15-MSM-26230___/
n16http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n7http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F14%3APU111904%21RIV15-MSM-26230___
rdf:type
skos:Concept n16:Vysledek
rdfs:seeAlso
http://link.springer.com/article/10.1007/s00236-014-0199-5
dcterms:description
This paper discusses finite automata regulated by control languages over their states and transition rules. It proves that under both regulations, regular-controlled finite automata and context-free-controlled finite automata characterize the family of regular languages and the family of context-free languages, respectively. It also establishes conditions under which any state-controlled finite automaton can be turned into an equivalent transition-controlled finite automaton and vice versa. The paper also demonstrates a close relation between these automata and programmed grammars. Indeed, it proves that finite automata controlled by languages generated by propagating programmed grammars with appearance checking are computationally complete. In fact, it demonstrates that this computational completeness holds even in terms of these automata with a reduced number of states. This paper discusses finite automata regulated by control languages over their states and transition rules. It proves that under both regulations, regular-controlled finite automata and context-free-controlled finite automata characterize the family of regular languages and the family of context-free languages, respectively. It also establishes conditions under which any state-controlled finite automaton can be turned into an equivalent transition-controlled finite automaton and vice versa. The paper also demonstrates a close relation between these automata and programmed grammars. Indeed, it proves that finite automata controlled by languages generated by propagating programmed grammars with appearance checking are computationally complete. In fact, it demonstrates that this computational completeness holds even in terms of these automata with a reduced number of states.
dcterms:title
Controlled Finite Automata Controlled Finite Automata
skos:prefLabel
Controlled Finite Automata Controlled Finite Automata
skos:notation
RIV/00216305:26230/14:PU111904!RIV15-MSM-26230___
n3:aktivita
n20:P
n3:aktivity
P(ED1.1.00/02.0070), P(TE01020415)
n3:cisloPeriodika
5
n3:dodaniDat
n15:2015
n3:domaciTvurceVysledku
n19:6513247 n19:4411439
n3:druhVysledku
n10:J
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
8874
n3:idVysledku
RIV/00216305:26230/14:PU111904
n3:jazykVysledku
n18:eng
n3:klicovaSlova
finite automata, controlled accepting, control languages, accepting power, computational completeness, reduction
n3:klicoveSlovo
n4:finite%20automata n4:reduction n4:accepting%20power n4:computational%20completeness n4:control%20languages n4:controlled%20accepting
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[13B9D78B65DA]
n3:nazevZdroje
Acta Informatica
n3:obor
n5:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n17:TE01020415 n17:ED1.1.00%2F02.0070
n3:rokUplatneniVysledku
n15:2014
n3:svazekPeriodika
51
n3:tvurceVysledku
Meduna, Alexandr Zemek, Petr
s:issn
0001-5903
s:numberOfPages
11
n7:doi
10.1007/s00236-014-0199-5
n12:organizacniJednotka
26230