论文信息 - More on the Descriptional Complexity of Products of Finite Automata - 字舞流文

More on the Descriptional Complexity of Products of Finite Automata

Markus Holzer | Christian Rauch

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

[2] Chrystopher L. Nehaniv,et al. Algebraic theory of automata networks - an introduction , 2005, SIAM monographs on discrete mathematics and applications.

[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] Markus Holzer,et al. The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract) , 2021, DLT.

[6] Tomás Masopust,et al. State Complexity of Projected Languages , 2011, DCFS.