Farid M. Ablayev. On Complexity of Regular (1, +k)-Branching Programs. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 229-240, Springer, 2000.
@inproceedings{Ablayev00, title = {On Complexity of Regular (1, +k)-Branching Programs}, author = {Farid M. Ablayev}, year = {2000}, researchr = {https://researchr.org/publication/Ablayev00}, cites = {0}, citedby = {0}, pages = {229-240}, booktitle = {Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings}, editor = {Ugo Montanari and José D. P. Rolim and Emo Welzl}, volume = {1853}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-67715-1}, }