论文信息 - The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract) - 字舞流文

The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract)

Markus Holzer | Christian Rauch

[1] Tadashi Ae. Direct or Cascade Product of Pushdown Automata , 1977, J. Comput. Syst. Sci..

[2] Galina Jirásková,et al. Magic Numbers and Ternary Alphabet , 2009, Int. J. Found. Comput. Sci..

[3] Markus Holzer,et al. The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract) , 2021, CIAA.

[4] Markus Holzer,et al. The Range of State Complexities of Languages Resulting from the Cut Operation , 2019, LATA.

[5] Galina Jirásková,et al. On the Square of Regular Languages , 2014, CIAA.

[6] Yahiko Kambayashi,et al. Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs , 2000, Theor. Comput. Sci..

[7] Oded Maler,et al. On the Krohn-Rhodes Cascaded Decomposition Theorem , 2010, Essays in Memory of Amir Pnueli.

[8] Kristína Cevorová. Kleene Star on Unary Regular Languages , 2013, DCFS.