@ARTICLE{MraOttPla14fi,
  author = {Frantisek Mráz and Friedrich Otto and Martin Plátek},
  title = {Free Word-Order and Restarting Automata},
  journal = {Fundamenta Informaticae},
  year = {2014},
  volume = {133},
  pages = {399--419},
  number = {4},
  note = {impact factor 0.479},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl = {http://dblp.uni-trier.de/rec/bib/journals/fuin/MrazOP14},
  doi = {10.3233/FI-2014-1083},
  timestamp = {Mon, 24 Nov 2014 12:17:47 +0100},
  url = {http://dx.doi.org/10.3233/FI-2014-1083},
  abstract = {In natural languages with a high degree of word-order freedom, syntactic phenomena like dependencies (subordinations) or valences do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: the degree of j-monotonicity, and the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.}
}