[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/iandc/Hoffmann23>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Stefan_Hoffmann_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1016%2Fj.ic.2023.105076>
foaf:homepage <https://doi.org/10.1016/j.ic.2023.105076>
dc:identifier DBLP journals/iandc/Hoffmann23 (xsd:string)
dc:identifier DOI doi.org%2F10.1016%2Fj.ic.2023.105076 (xsd:string)
dcterms:issued 2023 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/iandc>
rdfs:label Binary and circular automata having maximal state complexity for the set of synchronizing words. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Stefan_Hoffmann_0001>
swrc:month December (xsd:string)
swrc:number Part B (xsd:string)
swrc:pages 105076 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/iandc/Hoffmann23/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/iandc/Hoffmann23>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/iandc/iandc295.html#Hoffmann23>
rdfs:seeAlso <https://doi.org/10.1016/j.ic.2023.105076>
dc:title Binary and circular automata having maximal state complexity for the set of synchronizing words. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 295 (xsd:string)