| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Mráz, František | |
| dc.contributor.author | Plátek, Martin | |
| dc.contributor.author | Vogel, Jörg | |
| dc.date.accessioned | 2007-08-20T08:21:13Z | |
| dc.date.available | 2007-08-20T08:21:13Z | |
| dc.date.issued | 1998 | |
| dc.identifier.citation | Foundations of software technology and theoretical computer science : 18th Conference, Chennai, India, December 17-19, 1998. Proceedings. 1998, p. 343-354. | en |
| dc.identifier.isbn | 978-3-540-65384-4 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/10084/62042 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Foundations of software technology and theoretical computer science : 18th Conference, Chennai, India, December 17-19, 1998. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/b71635 | en |
| dc.title | Different Types of Monotonicity for Restarting Automata | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.description.abstract-en | We consider several classes of rewriting automata with a restart operation and the monotonicity property of computations by such automata. It leads to three natural definitions of (right) monotonicity of automata. Besides the former monotonicity, two new types, namely a-monotonicity and g-monotonicity, for such automata are introduced. We provide a taxonomy of the relevant language classes, and answer the (un)decidability questions concerning these properties. | en |
| dc.identifier.doi | 10.1007/b71635 | |
| dc.identifier.wos | 000084730000032 | |