Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications
| dc.contributor.author | Čermák, Martin | |
| dc.contributor.author | Horáček, Petr | |
| dc.contributor.author | Meduna, Alexander | |
| dc.coverage.issue | 1 | cs |
| dc.coverage.volume | 1 | cs |
| dc.date.accessioned | 2013-03-04T16:07:01Z | |
| dc.date.available | 2013-03-20T06:00:06Z | |
| dc.date.issued | 2012 | cs |
| dc.description.abstract | This 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.format | text | cs |
| dc.format.extent | 13-35 | cs |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Mathematics for Applications. 2012, 1, č. 1, s. 13-35. ISSN 1805-3629. | cs |
| dc.identifier.doi | 10.13164/ma.2012.02 | en |
| dc.identifier.issn | 1805-3629 | |
| dc.identifier.uri | http://hdl.handle.net/11012/19524 | |
| dc.language.iso | en | cs |
| dc.publisher | Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky | cs |
| dc.relation.ispartof | Mathematics of Applications | en |
| dc.relation.uri | http://ma.fme.vutbr.cz/archiv/1_1/13_35.pdf | cs |
| dc.rights | © Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky | cs |
| dc.rights.access | openAccess | en |
| dc.title | Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications | en |
| dc.type.driver | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |
| eprints.affiliatedInstitution.department | Ústav matematiky | cs |
| eprints.affiliatedInstitution.faculty | Fakulta strojního inženýrství | cs |