On the length of word chains
From MaRDI portal
Publication:1108812
DOI10.1016/0020-0190(87)90031-7zbMath0654.68096MaRDI QIDQ1108812
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90031-7
Related Items
Optimal word chains for the Thue-Morse word, Efficient and optimal exponentiation in finite fields, Tight lower bounds on the length of word chains, A note on word chains and regular languages, Processor-efficient exponentiation in finite fields, The number of minimal word chains computing the Thue-Morse word, Simulating finite automata with context-free grammars., Constructing small tree grammars and small circuits for formulas, Asymptotical behaviour of some non-uniform measures
Cites Work