2003
AUTHORSDimitry S. Ananichev , Mikhail V. Volkov
ABSTRACTWe show that if the state set Q of a synchronizing automaton \( \mathcal{A} = \left\langle {Q,\sum ,\delta } \right\rangle \) admits a linear order such that for each letter a ∈ Σ the transformation δ(_, a) of Q preserves this order, then \( \mathcal{A} \) possesses a reset word of length |Q| − 1. We also consider two natural generalizations of the notion of a reset word and provide for them results of a similar flavour. More... »
PAGES111-121
Developments in Language Theory
ISBN
978-3-540-40434-7
978-3-540-45007-8
http://scigraph.springernature.com/pub.10.1007/3-540-45007-6_8
DOIhttp://dx.doi.org/10.1007/3-540-45007-6_8
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1012248703
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1702",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Cognitive Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/17",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Psychology and Cognitive Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Ural Federal University",
"id": "https://www.grid.ac/institutes/grid.412761.7",
"name": [
"Department of Mathematics and Mechanics, Ural State University, 620083\u00a0Ekaterinburg, Russia"
],
"type": "Organization"
},
"familyName": "Ananichev",
"givenName": "Dimitry S.",
"type": "Person"
},
{
"affiliation": {
"alternateName": "Ural Federal University",
"id": "https://www.grid.ac/institutes/grid.412761.7",
"name": [
"Department of Mathematics and Mechanics, Ural State University, 620083\u00a0Ekaterinburg, Russia"
],
"type": "Organization"
},
"familyName": "Volkov",
"givenName": "Mikhail V.",
"id": "sg:person.013001640142.17",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013001640142.17"
],
"type": "Person"
}
],
"citation": [
{
"id": "sg:pub.10.1007/3-540-44683-4_38",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1011932985",
"https://doi.org/10.1007/3-540-44683-4_38"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1137/0219033",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1062842216"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1051/ita/1998321-300211",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1083550556"
],
"type": "CreativeWork"
}
],
"datePublished": "2003",
"datePublishedReg": "2003-01-01",
"description": "We show that if the state set Q of a synchronizing automaton \\( \\mathcal{A} = \\left\\langle {Q,\\sum ,\\delta } \\right\\rangle \\) admits a linear order such that for each letter a \u2208 \u03a3 the transformation \u03b4(_, a) of Q preserves this order, then \\( \\mathcal{A} \\) possesses a reset word of length |Q| \u2212 1. We also consider two natural generalizations of the notion of a reset word and provide for them results of a similar flavour.",
"editor": [
{
"familyName": "\u00c9sik",
"givenName": "Zolt\u00e1n",
"type": "Person"
},
{
"familyName": "F\u00fcl\u00f6p",
"givenName": "Zolt\u00e1n",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/3-540-45007-6_8",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isFundedItemOf": [
{
"id": "sg:grant.5419817",
"type": "MonetaryGrant"
},
{
"id": "sg:grant.5358152",
"type": "MonetaryGrant"
}
],
"isPartOf": {
"isbn": [
"978-3-540-40434-7",
"978-3-540-45007-8"
],
"name": "Developments in Language Theory",
"type": "Book"
},
"name": "Synchronizing Monotonic Automata",
"pagination": "111-121",
"productId": [
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/3-540-45007-6_8"
]
},
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"3a5b68fe807f65e456ec748652f128cf50aa570e4c97b72868c773b113788b80"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1012248703"
]
}
],
"publisher": {
"location": "Berlin, Heidelberg",
"name": "Springer Berlin Heidelberg",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/3-540-45007-6_8",
"https://app.dimensions.ai/details/publication/pub.1012248703"
],
"sdDataset": "chapters",
"sdDatePublished": "2019-04-15T15:54",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8672_00000559.jsonl",
"type": "Chapter",
"url": "http://link.springer.com/10.1007/3-540-45007-6_8"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-45007-6_8'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-45007-6_8'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-45007-6_8'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-45007-6_8'
This table displays all metadata directly associated to this object as RDF triples.
90 TRIPLES
23 PREDICATES
30 URIs
20 LITERALS
8 BLANK NODES