EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 23 / No 3 (1989) RAIRO-Theor. Inf. Appl., 23 3 (1989) 281-293 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 23, Number 3, 1989
Page(s) 281 - 293
DOI https://doi.org/10.1051/ita/1989230302811
Published online 01 February 2017
  1. [Ba, Di, Ga, 85] J. L. BALCAZAR, J. DIAZ and J. GABARRO, Uniform Characterizations of Non-Uniform Measures, Inf. and Cont., Vol. 67, 1985, pp. 53-69. [MR: 833860] [Zbl: 0588.68021] [Google Scholar]
  2. [Be, Br] J. BERSTEL and S. BRLEK, On the Length of Word Chains, I.P.L., Vol. 26, 1987, pp. 23-28. [MR: 908568] [Zbl: 0654.68096] [Google Scholar]
  3. [Bu, Cu, Ma, Wo, 81] W. BUCHER, K. CULIK, H. MAURER and D. WOTSCHKE, Concise Description of Finite Languages, Theor. Comp. Sci., Vol. 14, 1981, pp. 227-246. [MR: 619000] [Zbl: 0469.68081] [Google Scholar]
  4. [Ch, 66] G. J. CHAITIN, On the Length of Programs for Compute Finite Binary Sequences, Jour. A. C. M., Vol. 13, No. 4, 1966, pp. 547-569. [MR: 210520] [Zbl: 0158.25301] [Google Scholar]
  5. [Eh, Ze, 74] A. EHRENFEUCHT and P. ZEIGER, Complexity Measures for Regular Expressions, J. Comp. and Sys. Sci., Vol. 12, No. 2, 1976, pp. 134-146. [MR: 418509] [Zbl: 0329.94024] [Google Scholar]
  6. [F1, U11, 82] R. FLOYD and J. ULLMAN, The Compilation of Regular Expressions into Integrated Circuits, Jour. A. C. M., Vol. 29, No. 2, 1982, pp. 603-622. [MR: 666770] [Zbl: 0485.68047] [Google Scholar]
  7. [Ga, 83] J. GABARRO, Initial Index : a New Complexity Function for languages, I. C. A. L. P. 83 L. N. C. S. 154, Springer-Verlag, 1983, pp. 226-236. [MR: 727660] [Zbl: 0523.68068] [Google Scholar]
  8. [Go, La, Fi, 77] G. GOODRICH, R. LADNER and M. FISHER, Straight Line Programs to Compute Finite Languages, Conf. on Theor. Comp. Sci., Waterloo, 1977. [Zbl: 0409.68025] [Google Scholar]
  9. [Kr, Le, 84] M. R. KRAMER and J. VAN LEEUWEN, The VLSI Complexity of Boolean Functions, L.N.C.S. 171, Springer-Verlag, 1984, pp. 397-407. [MR: 775178] [Zbl: 0551.94025] [Google Scholar]
  10. [Lu, 58] O. B. LUPANOV, A Method of Circuit Synthesis, Izv. V.U.Z. Radiofiz, Vol. 1, 1958, pp. 120-140. [Google Scholar]
  11. [Lu, 62] O. B. LUPANOV, Complexity of Formula Realization of Functions of Logical Algebra, Prob. Kibern., Vol. 3, 1962, pp. 782-811. [Google Scholar]
  12. [Lu, 70] O. B LUPANOV, On Circuits of Functional Elements with Delay, Problems of Cybernetics [in Russian], Vol. 23, 1970, pp. 43-81. [MR: 332361] [Zbl: 0267.94037] [Google Scholar]
  13. [Ne, 65] E. I. NECHIPORUK, On the Design of Logical Networks in Incomplete and Degenerate Bases, Problems of Cybernetics [in Russian], Vol. 14, 1965, pp. 111-160. [Google Scholar]
  14. [Ri, Sha, 42] J. RIORDAN and C. E. SHANNON, The Number of Two-Terminals Series Parallel Networks, J. on Math. Phys., Vol. 21, 1942, pp. 83-93. [MR: 7511] [Google Scholar]
  15. [Sto, 79] L. J. STOCKMEYER, Classifying the computational Complexity of Problems, M.I.T. Research Report R.C. 7606, 1979. [Google Scholar]
  16. [Ug, 76] A. B. UGOLNIKOV, On the Realization of Monotone Functions by Circuits of Functional Elements, Problems of Cybernetics [in Russian], Vol. 31, 1976, pp. 167-185. [MR: 421891] [Google Scholar]
  17. [We, 87] I. WEGENER, The Complexity of Boolean Functions, Wiley-Teubner, 1987. [MR: 905473] [Zbl: 0623.94018] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.