Regexp-hakujen toteuttaminen äärellisillä automaateilla

Tässä kirjallisuuskatsauksessa tarkastellaan, miten säännöllisiä lausek- keita käyttävät merkkijonohaut voidaan toteuttaa äärellisten automaattien avulla. Sen lisäksi muutamia kirjallisuudesta löytyviä toteutustapoja tarkastellaan yksityis- kohtaisemmin. This literature review explains how regular...

Full description

Bibliographic Details
Main Author: Lahtonen, Markus
Other Authors: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, University of Jyväskylä, Jyväskylän yliopisto
Format: Bachelor's thesis
Language:fin
Published: 2016
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/49778
_version_ 1826225793565458432
author Lahtonen, Markus
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology University of Jyväskylä Jyväskylän yliopisto
author_facet Lahtonen, Markus Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology University of Jyväskylä Jyväskylän yliopisto Lahtonen, Markus Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology University of Jyväskylä Jyväskylän yliopisto
author_sort Lahtonen, Markus
datasource_str_mv jyx
description Tässä kirjallisuuskatsauksessa tarkastellaan, miten säännöllisiä lausek- keita käyttävät merkkijonohaut voidaan toteuttaa äärellisten automaattien avulla. Sen lisäksi muutamia kirjallisuudesta löytyviä toteutustapoja tarkastellaan yksityis- kohtaisemmin. This literature review explains how regular expression matching can be implemented using finite-state automata. Moreover, some implementations found in the literature will be reviewed in greater detail.
first_indexed 2016-05-13T20:00:33Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "M\u00f6nk\u00f6l\u00e4, Sanna", "language": null, "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "Lahtonen, Markus", "language": null, "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2016-05-13T13:19:19Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2016-05-13T13:19:19Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2016", "language": null, "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/49778", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "T\u00e4ss\u00e4 kirjallisuuskatsauksessa tarkastellaan, miten s\u00e4\u00e4nn\u00f6llisi\u00e4 lausek-\nkeita k\u00e4ytt\u00e4v\u00e4t merkkijonohaut voidaan toteuttaa \u00e4\u00e4rellisten automaattien avulla.\nSen lis\u00e4ksi muutamia kirjallisuudesta l\u00f6ytyvi\u00e4 toteutustapoja tarkastellaan yksityis-\nkohtaisemmin.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "This literature review explains how regular expression matching can be\nimplemented using finite-state automata. Moreover, some implementations found\nin the literature will be reviewed in greater detail.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted using Plone Publishing form by Markus Lahtonen (mahelaht) on 2016-05-13 13:19:18.764640. Form: Kandidaatintutkielma -lomake (https://kirjasto.jyu.fi/julkaisut/julkaisulomakkeet/kandin-tutkielma-lomake). JyX data: [jyx_publishing-allowed (fi) =True]", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by jyx lomake-julkaisija (jyx-julkaisija.group@korppi.jyu.fi) on 2016-05-13T13:19:19Z\nNo. of bitstreams: 2\nURN:NBN:fi:jyu-201605132545.pdf: 176916 bytes, checksum: 1120a6f2356c280fc1ea3ef564bbff37 (MD5)\nlicense.html: 4805 bytes, checksum: 9a01a1c9da9af3f4143798bc6a9c75a6 (MD5)", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2016-05-13T13:19:19Z (GMT). No. of bitstreams: 2\nURN:NBN:fi:jyu-201605132545.pdf: 176916 bytes, checksum: 1120a6f2356c280fc1ea3ef564bbff37 (MD5)\nlicense.html: 4805 bytes, checksum: 9a01a1c9da9af3f4143798bc6a9c75a6 (MD5)\n Previous issue date: 2016", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "21", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "regexp", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "s\u00e4\u00e4nn\u00f6llinen lauseke", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "\u00e4\u00e4rellinen automaatti", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Regexp-hakujen toteuttaminen \u00e4\u00e4rellisill\u00e4 automaateilla", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-201605132545", "language": null, "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatintutkielma", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.date.updated", "value": "2016-05-13T13:19:19Z", "language": null, "element": "date", "qualifier": "updated", "schema": "dc"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": "fi", "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_49778
language fin
last_indexed 2025-02-18T10:54:39Z
main_date 2016-01-01T00:00:00Z
main_date_str 2016
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/b073215c-e58d-49e3-89e3-0e30ab0f9082\/download","text":"URN:NBN:fi:jyu-201605132545.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2016
record_format qdc
source_str_mv jyx
spellingShingle Lahtonen, Markus Regexp-hakujen toteuttaminen äärellisillä automaateilla regexp säännöllinen lauseke äärellinen automaatti Tietotekniikka Mathematical Information Technology
title Regexp-hakujen toteuttaminen äärellisillä automaateilla
title_full Regexp-hakujen toteuttaminen äärellisillä automaateilla
title_fullStr Regexp-hakujen toteuttaminen äärellisillä automaateilla Regexp-hakujen toteuttaminen äärellisillä automaateilla
title_full_unstemmed Regexp-hakujen toteuttaminen äärellisillä automaateilla Regexp-hakujen toteuttaminen äärellisillä automaateilla
title_short Regexp-hakujen toteuttaminen äärellisillä automaateilla
title_sort regexp hakujen toteuttaminen äärellisillä automaateilla
title_txtP Regexp-hakujen toteuttaminen äärellisillä automaateilla
topic regexp säännöllinen lauseke äärellinen automaatti Tietotekniikka Mathematical Information Technology
topic_facet Mathematical Information Technology Tietotekniikka regexp säännöllinen lauseke äärellinen automaatti
url https://jyx.jyu.fi/handle/123456789/49778 http://www.urn.fi/URN:NBN:fi:jyu-201605132545
work_keys_str_mv AT lahtonenmarkus regexphakujentoteuttaminenäärellisilläautomaateilla