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

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

Namespace Prefixes

PrefixIRI
n20http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://purl.org/net/nknouf/ns/bibtex#
n9http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/ontology/domain/vavai/
n8https://schema.org/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F08%3APU76738%21RIV10-GA0-26230___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://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#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F08%3APU76738%21RIV10-GA0-26230___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
This article defines two-way coupled finite automata. A two-way coupled finite automaton enable us to make a translation from input language to output language and from output language to input language too. Deterministic parsing using coupled finite automaton is discussed. For instance, this<br>deterministic model can be used for translation between assembly language and binary code.<br> This article defines two-way coupled finite automata. A two-way coupled finite automaton enable us to make a translation from input language to output language and from output language to input language too. Deterministic parsing using coupled finite automaton is discussed. For instance, this<br>deterministic model can be used for translation between assembly language and binary code.<br>
dcterms:title
Two-Way Coupled Finite Automaton and Its Usage in Translators Two-Way Coupled Finite Automaton and Its Usage in Translators
skos:prefLabel
Two-Way Coupled Finite Automaton and Its Usage in Translators Two-Way Coupled Finite Automaton and Its Usage in Translators
skos:notation
RIV/00216305:26230/08:PU76738!RIV10-GA0-26230___
n3:aktivita
n17:P
n3:aktivity
P(FT-TA3/128), P(GA201/07/0005)
n3:dodaniDat
n15:2010
n3:domaciTvurceVysledku
n4:8552533 n4:3398706 n4:8820074 n4:9238948
n3:druhVysledku
n6:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
401006
n3:idVysledku
RIV/00216305:26230/08:PU76738
n3:jazykVysledku
n12:eng
n3:klicovaSlova
Two-way coupled finite automaton, lazy finite automaton, lazy finite transducer, deterministic finite transducer, translator, assembly language, binary code, HW/SW co-design
n3:klicoveSlovo
n10:binary%20code n10:lazy%20finite%20automaton n10:lazy%20finite%20transducer n10:translator n10:deterministic%20finite%20transducer n10:assembly%20language n10:HW%2FSW%20co-design n10:Two-way%20coupled%20finite%20automaton
n3:kontrolniKodProRIV
[6AFE76BA78C7]
n3:mistoKonaniAkce
Kréta
n3:mistoVydani
Heraklion
n3:nazevZdroje
New Aspects of Circuits
n3:obor
n14:JC
n3:pocetDomacichTvurcuVysledku
4
n3:pocetTvurcuVysledku
4
n3:projekt
n11:GA201%2F07%2F0005 n11:FT-TA3%2F128
n3:rokUplatneniVysledku
n15:2008
n3:tvurceVysledku
Hruška, Tomáš Zámečníková, Eva Kolář, Dušan Lukáš, Roman
n3:typAkce
n20:WRD
n3:zahajeniAkce
2008-07-22+02:00
s:numberOfPages
5
n13:hasPublisher
World Scientific and Engineering Academy
n8:isbn
978-960-6766-82-4
n9:organizacniJednotka
26230