Ver registro no DEDALUS
Exportar registro bibliográfico

Metrics


Metrics:

Iterative minimization of partial finite state machines (2013)

  • Authors:
  • USP affiliated authors: SIMÃO, ADENILSO DA SILVA - ICMC
  • USP Schools: ICMC
  • DOI: 10.2478/s13537-013-0106-0
  • Subjects: ENGENHARIA DE SOFTWARE; SISTEMAS DE INFORMAÇÃO
  • Language: Inglês
  • Imprenta:
  • Source:
  • Acesso online ao documento

    Online accessDOI or search this record in
    Informações sobre o DOI: 10.2478/s13537-013-0106-0 (Fonte: oaDOI API)
    • Este periódico é de acesso aberto
    • Este artigo é de acesso aberto
    • URL de acesso aberto
    • Cor do Acesso Aberto: gold
    • Licença: cc-by-nc-nd
    Versões disponíveis em Acesso Aberto do: 10.2478/s13537-013-0106-0 (Fonte: Unpaywall API)

    Título do periódico: Open Computer Science

    ISSN: 2299-1093

    • Melhor URL em Acesso Aberto:


    • Outras alternativas de URLs em Acesso Aberto:

    Exemplares físicos disponíveis nas Bibliotecas da USP
    BibliotecaCód. de barrasNúm. de chamada
    ICMC2394641-10PROD 2394641
    How to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      ALBERTO, Alex D. B; SIMÃO, Adenilso da Silva. Iterative minimization of partial finite state machines. Central European Journal of Computer Science, Varsóvia , Polônia, Versita, co-publicado com a Springer-Verlag GmbH, v. 3, n. 2 , p. 91-103, 2013. Disponível em: < http://dx.doi.org/10.2478/s13537-013-0106-0 > DOI: 10.2478/s13537-013-0106-0.
    • APA

      Alberto, A. D. B., & Simão, A. da S. (2013). Iterative minimization of partial finite state machines. Central European Journal of Computer Science, 3( 2 ), 91-103. doi:10.2478/s13537-013-0106-0
    • NLM

      Alberto ADB, Simão A da S. Iterative minimization of partial finite state machines [Internet]. Central European Journal of Computer Science. 2013 ; 3( 2 ): 91-103.Available from: http://dx.doi.org/10.2478/s13537-013-0106-0
    • Vancouver

      Alberto ADB, Simão A da S. Iterative minimization of partial finite state machines [Internet]. Central European Journal of Computer Science. 2013 ; 3( 2 ): 91-103.Available from: http://dx.doi.org/10.2478/s13537-013-0106-0

    Referências citadas na obra
    Bomze I., Budinich M., Pardalos P., Pelillo M., The maximum clique problem, In: Du D.-Z., Pardalos P. (Eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, 1999
    Grasselli A., Luccio F., A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks, IEEE T COMPUT, 1965, EC-14, 350–359
    Gören, S., Ferguson, F.J., CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines, DATE’ 02: Proceedings of the conference on Design, automation and test in Europe (Paris, France), 2002, 248–254
    Gören, S., Ferguson, F.J., On state reduction of incompletely specified finite state machines, COMPUT ELECTR ENG, 2007, 33, 58–69
    Hachtel G.D., Rho J.K., Somenzi F., Jacoby R., Exact and heuristic algorithms for the minimization of incompletely specified state machines, EURO-DAC’ 91: Proceedings of the conference on European design automation (Amsterdam, The Netherlands), IEEE Computer Society Press, 1991, 184–191
    Higuchi H., Matsunaga Y., A fast state reduction algorithm for incompletely specified finite state machine, DAC’ 96: Proceedings of the 33rd annual conference on Design automation (Las Vegas, Nevada, United States), ACM, 1996, 463–466
    Kam T., Villa T., Brayton R., Sangiovanni-Vincentelli A., A fully implicit algorithm for exact state minimization, DAC’ 94: Proceedings of the 31st annual conference on Design automation (San Diego, California, United States), ACM, 1994, 684–690
    Lavagno L., Moon C.W., Brayton R.K., Sangiovanni-Vincentelli A.L., Solving the state assignment problem for signal transition graphs, DAC’ 92: Proceedings of the 29th ACM/IEEE conference on Design automation (Anaheim, California, United States), IEEE Computer Society Press, 1992, 568–572
    Moore E.F., Gedanken-Experiments on Sequential Machines, In: Shannon C., McCarthy J. (Eds.), Automata Studies, Princeton University Press, Princeton, NJ, 1956
    Paull M.C., Unger S.H., Minimizing the number of states in incompletely specified sequential switching functions, IRE Trans. Electron. Comput., 1959, EC-8, 356–367
    Pena J.M., Oliveira A.L., A new algorithm for the reduction of incompletely specified finite state machines, ICCAD’ 98 Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design (San Jose, California, United States), ACM, 1998, 482–489
    Pfleeger C.P., State Reduction in Incompletely Specified Finite-State Machines, IEEE T COMPUT, 1973, 22, 1099–1102
    Sentovich E.M., et al., SIS: A System for Sequential Circuit Synthesis, Technical Report, University of California, Berkeley, CA, 1992