{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q418159","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q418159","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q418159","kernelVersion":"v1","immutable":true,"modified":"2026-01-18T10:28:24Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q418159","name":"A compact representation of nondeterministic (suffix) automata for the bit-parallel approach","headline":"A compact representation of nondeterministic (suffix) automata for the bit-parallel approach","description":"scientific article; zbMATH DE number 6038303","url":"https://portal.mardi4nfdi.de/entity/Q418159","datePublished":"2012-05-24","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q313071"},{"@id":"https://portal.mardi4nfdi.de/entity/Q390884"},{"@id":"https://portal.mardi4nfdi.de/entity/Q401469"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q259032"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.IC.2011.03.006","url":"https://doi.org/10.1016/J.IC.2011.03.006"},"sameAs":["https://doi.org/10.1016/J.IC.2011.03.006"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3090391"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4849531"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1014420"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3799643"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4148937"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5463398"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5897133"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3507759"}]},"provenance":{"prov:generatedAtTime":"2026-01-18T10:28:24Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}