Show simple item record

dc.contributor.authorČermák, Martin
dc.contributor.authorHoráček, Petr
dc.contributor.authorMeduna, Alexander
dc.date.accessioned2013-03-04T16:07:01Z
dc.date.available2013-03-20T06:00:06Z
dc.date.issued2012cs
dc.identifier.citationMathematics for Applications. 2012, 1, č. 1, s. 13-35. ISSN 1805-3629.cs
dc.identifier.issn1805-3629
dc.identifier.urihttp://hdl.handle.net/11012/19524
dc.description.abstractThis paper introduces the notion of a new transducer as a two-component system, which consists of a nite automaton and a context-free grammar. In essence, while the automaton reads its input string, the grammar produces its output string, and their cooperation is controlled by a set, which restricts the usage of their rules. From a theoretical viewpoint, the present paper discusses the power of this system working in an ordinary way as well as in a leftmost way. In addition, the paper introduces an appearance checking, which allows us to check whether some symbols are present in the rewritten string, and studies its e ect on the power. It achieves the following three main results. First, the system generates and accepts languages de ned by matrix grammars and partially blind multi-counter automata, respectively. Second, if we place a leftmost restriction on derivation in the context-free grammar, both accepting and generating power of the system is equal to generative power of context-free grammars. Third, the system with appearance checking can accept and generate all recursively enumerable languages. From more pragmatical viewpoint, this paper describes several linguistic applications. A special attention is paid to the Japanese-Czech translation.en
dc.formattextcs
dc.format.extent13-35cs
dc.format.mimetypeapplication/pdfen
dc.language.isoencs
dc.publisherVysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.relation.ispartofMathematics of Applicationsen
dc.relation.urihttp://ma.fme.vutbr.cz/archiv/1_1/13_35.pdfcs
dc.rights© Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.titleRule-restricted Automaton-grammar transducers: Power and Linguistic Applicationsen
eprints.affiliatedInstitution.departmentÚstav matematikycs
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
dc.coverage.issue1cs
dc.coverage.volume1cs
dc.identifier.doi10.13164/ma.2012.02en
dc.rights.accessopenAccessen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record