Standard

The annulation threshold for partially monotonic automata. / Ananichev, D. S.
In: Russian Mathematics, Vol. 54, No. 1, 2010, p. 1-9.

Research output: Contribution to journal › Article › peer-review

Harvard

Ananichev, DS 2010, 'The annulation threshold for partially monotonic automata', Russian Mathematics, vol. 54, no. 1, pp. 1-9. https://doi.org/10.3103/S1066369X10010019

APA

Ananichev, D. S. (2010). The annulation threshold for partially monotonic automata. Russian Mathematics, 54(1), 1-9. https://doi.org/10.3103/S1066369X10010019

Vancouver

Ananichev DS. The annulation threshold for partially monotonic automata. Russian Mathematics. 2010;54(1):1-9. doi: 10.3103/S1066369X10010019

Author

Ananichev, D. S. / The annulation threshold for partially monotonic automata. In: Russian Mathematics. 2010 ; Vol. 54, No. 1. pp. 1-9.

BibTeX

@article{c6c4ac1a72a64790a48d89ebb29c530a,
title = "The annulation threshold for partially monotonic automata",
abstract = "A deterministic incomplete automaton script A sign = Q, ∑, δ is partially monotonic if its state set Q admits a linear order such that each partial transformation δ(-, a) with a ∑ preserves the restriction of the order to the domain of the transformation. We show that if script A sign possesses an annihilator word w ∑*whose action is nowhere defined, then script A sign is annihilated by a word of length |Q| + {|Q|-1/2 and this bound is tight. {\textcopyright} 2010 Allerton Press, Inc.",
author = "Ananichev, {D. S.}",
year = "2010",
doi = "10.3103/S1066369X10010019",
language = "English",
volume = "54",
pages = "1--9",
journal = "Russian Mathematics",
issn = "1066-369X",
publisher = "Pleiades Publishing",
number = "1",

}

RIS

TY - JOUR

T1 - The annulation threshold for partially monotonic automata

AU - Ananichev, D. S.

PY - 2010

Y1 - 2010

N2 - A deterministic incomplete automaton script A sign = Q, ∑, δ is partially monotonic if its state set Q admits a linear order such that each partial transformation δ(-, a) with a ∑ preserves the restriction of the order to the domain of the transformation. We show that if script A sign possesses an annihilator word w ∑*whose action is nowhere defined, then script A sign is annihilated by a word of length |Q| + {|Q|-1/2 and this bound is tight. © 2010 Allerton Press, Inc.

AB - A deterministic incomplete automaton script A sign = Q, ∑, δ is partially monotonic if its state set Q admits a linear order such that each partial transformation δ(-, a) with a ∑ preserves the restriction of the order to the domain of the transformation. We show that if script A sign possesses an annihilator word w ∑*whose action is nowhere defined, then script A sign is annihilated by a word of length |Q| + {|Q|-1/2 and this bound is tight. © 2010 Allerton Press, Inc.

UR - http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=78649562717

U2 - 10.3103/S1066369X10010019

DO - 10.3103/S1066369X10010019

M3 - Article

VL - 54

SP - 1

EP - 9

JO - Russian Mathematics

JF - Russian Mathematics

SN - 1066-369X

IS - 1

ER -

ID: 38004458