diff options
author | Martin Czygan <martin.czygan@gmail.com> | 2020-11-26 00:34:45 +0100 |
---|---|---|
committer | Martin Czygan <martin.czygan@gmail.com> | 2020-11-26 00:34:45 +0100 |
commit | a8d155cf574cdf5bf5ed1f7ec58f470fb724a7b3 (patch) | |
tree | 9651178663e9f8d9b793fd2fa0ab165d55e7fc1d | |
parent | 7370865afed676b18dc73945ee902d5d4fef81e5 (diff) | |
download | fuzzycat-a8d155cf574cdf5bf5ed1f7ec58f470fb724a7b3.tar.gz fuzzycat-a8d155cf574cdf5bf5ed1f7ec58f470fb724a7b3.zip |
add case
-rw-r--r-- | tests/data/release/s6znyezm4fdqfiihwcdtfapfqu | 49 | ||||
-rw-r--r-- | tests/data/release/wz6kycfyqfdhhbcjteotw4jcbu | 82 | ||||
-rw-r--r-- | tests/data/verify.csv | 1 |
3 files changed, 132 insertions, 0 deletions
diff --git a/tests/data/release/s6znyezm4fdqfiihwcdtfapfqu b/tests/data/release/s6znyezm4fdqfiihwcdtfapfqu new file mode 100644 index 0000000..50c1ab0 --- /dev/null +++ b/tests/data/release/s6znyezm4fdqfiihwcdtfapfqu @@ -0,0 +1,49 @@ +{ + "abstracts": [ + { + "content": "Stochastic automata over monoids as input sets are studied. The\nwell-definedness of these automata requires an extension postulate that\nreplaces the inherent universal property of free monoids. As a generalization\nof Turakainen's result, it will be shown that the generalized automata over\nmonoids have the same acceptance power as their stochastic counterparts. The\nkey to homomorphisms is a commuting property between the monoid homomorphism of\ninput states and the monoid homomorphism of transition matrices. Closure\nproperties of the languages accepted by stochastic automata over monoids are\ninvestigated. matrices. Closure properties of the languages accepted by\nstochastic automata over monoids are investigated.", + "lang": "en", + "mimetype": "text/plain", + "sha1": "34aa00cd88504e82e9ecedb92e5e12e8e7beeea0" + } + ], + "contribs": [ + { + "index": 0, + "raw_name": "Karl-Heinz Zimmermann", + "role": "author" + }, + { + "index": 1, + "raw_name": "Merve Nur Cakir", + "role": "author" + } + ], + "ext_ids": { + "arxiv": "2002.01214v1" + }, + "extra": { + "arxiv": { + "acm_class": "F.1.1", + "base_id": "2002.01214", + "categories": [ + "cs.FL", + "cs.CL" + ], + "comments": "29 pages, 2 figures" + } + }, + "ident": "s6znyezm4fdqfiihwcdtfapfqu", + "language": "en", + "license_slug": "ARXIV-1.0", + "refs": [], + "release_date": "2020-02-04", + "release_stage": "submitted", + "release_type": "article", + "release_year": 2020, + "revision": "ed91538b-373f-49ac-95e3-027ee7d0857a", + "state": "active", + "title": "On Stochastic Automata over Monoids", + "version": "v1", + "work_id": "nuesnopp6rcqvhgxllzmzrz7vm" +} diff --git a/tests/data/release/wz6kycfyqfdhhbcjteotw4jcbu b/tests/data/release/wz6kycfyqfdhhbcjteotw4jcbu new file mode 100644 index 0000000..76dfc77 --- /dev/null +++ b/tests/data/release/wz6kycfyqfdhhbcjteotw4jcbu @@ -0,0 +1,82 @@ +{ + "abstracts": [ + { + "content": "Stochastic automata over monoids as input sets are studied. The well-definedness of these automata requires an extension postulate that replaces the inherent universal property of free monoids. As a generalization of Turakainen's result, it will be shown that the generalized automata over monoids have the same acceptance power as their stochastic counterparts. The key to homomorphisms is a commuting property between the monoid homomorphism of input states and the monoid homomorphism of transition matrices. Closure properties of the languages accepted by stochastic automata over monoids are investigated. matrices. Closure properties of the languages accepted by stochastic automata over monoids are investigated.", + "lang": "en", + "mimetype": "text/plain", + "sha1": "15947510a2bf96ced201a4ffe23c89c24f3c96b4" + } + ], + "contribs": [ + { + "given_name": "Merve Nur", + "index": 0, + "raw_name": "Merve Nur Cakir", + "role": "author", + "surname": "Cakir" + }, + { + "creator_id": "e352uirosrdtris24fgz3r46va", + "given_name": "Karl-Heinz", + "index": 1, + "raw_name": "Karl-Heinz Zimmermann", + "role": "author", + "surname": "Zimmermann" + }, + { + "extra": { + "type": "DataManager" + }, + "raw_name": "TUHH Universitätsbibliothek", + "role": "author" + } + ], + "ext_ids": { + "doi": "10.15480/882.3079" + }, + "extra": { + "datacite": { + "license": [ + { + "rights": "http://rightsstatements.org/vocab/InC/1.0/", + "rightsUri": "http://rightsstatements.org/vocab/InC/1.0/" + }, + { + "rightsUri": "info:eu-repo/semantics/openAccess" + } + ], + "metadataVersion": 1, + "resourceType": "Other", + "resourceTypeGeneral": "Text", + "subjects": [ + { + "subject": "Stochastic automaton" + }, + { + "subject": "monoid" + }, + { + "subject": "formal language" + }, + { + "subject": "510: Mathematik", + "subjectScheme": "ddc" + } + ] + }, + "release_month": 11 + }, + "ident": "wz6kycfyqfdhhbcjteotw4jcbu", + "language": "en", + "license_slug": "RS-INC", + "publisher": "TUHH Universitätsbibliothek", + "refs": [], + "release_date": "2020-11-19", + "release_stage": "published", + "release_type": "article", + "release_year": 2020, + "revision": "e104b078-6cd1-4e2d-b882-aa4f1c4d5c6d", + "state": "active", + "title": "On stochastic automata over monoids", + "work_id": "fmh2ydkeqrbefginas2vo3s4mu" +} diff --git a/tests/data/verify.csv b/tests/data/verify.csv index 1ac555f..368c8c4 100644 --- a/tests/data/verify.csv +++ b/tests/data/verify.csv @@ -85,3 +85,4 @@ jdtngtiz3bdqboypujoni2x3ry,byh7xr5qhjca3bw53ivdotck3e,Status.EXACT, hqrvhbvocvaabg6nr5p43tl3uq,zfwf3tefajc6zdxa47vgilm7wm,TODO, ppnzru2opnhxlai7pcmo7phe4i,iitldffmnncijgnf6ujb6zmdfu,Status.DIFFERENT,Miss.NUM_DIFF fv35r37pb5c5tioyqburswsute,poeywm5o4raljhatd6zvehcicy,Status.EXACT,OK.TITLE_AUTHOR_MATCH +s6znyezm4fdqfiihwcdtfapfqu,wz6kycfyqfdhhbcjteotw4jcbu,, |