Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Frid, Anna - Sobolev Institute of Mathematics, Russian Academy of Sciences, Novosibirsk
Journal of Automata, Languages and Combinatorics 7 (2002) 1, x{y Otto-von-Guericke-Universitat Magdeburg
Journal of Automata, Languages and Combinatorics 3 (1998) 1, 29--41 fl OttovonGuerickeUniversitat Magdeburg
Sequences of Linear Arithmetical Complexity #
On arithmetical complexity of Sturmian words J. Cassaigne, A. E. Frid
On automatic infinite permutations A. Frid # and L. Zamboni +
On Uniform DOL Words ? Anna E. Frid 1
Simple equations on binary factorial A. E. Frid a
Low maximal pattern complexity of infinite permutations
Theoretical Informatics and Applications Will be set by the publisher
Arithmetical Complexity of In nite Words S. V. Avgustinovich,
A Unique Decomposition Theorem for Factorial Languages
Arithmetical complexity of symmetric D0L A. E. Frid a
Theoretical Informatics and Applications Will be set by the publisher Informatique Th eorique et Applications
