On the descriptional complexity of the direct product of finite automata

DOI10.1007/978-3-031-13257-5_8OpenAlexW4299884370MaRDI QIDQ2112184

Christian Rauch, Markus Holzer

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_8

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
• Direct or cascade product of pushdown automata
• More on the descriptional complexity of products of finite automata
• The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
• Algebraic Theory of Automata Networks

This page was built for publication: On the descriptional complexity of the direct product of finite automata