共 50 条
- [27] NONCOMMUTATIVE ARITHMETIC CIRCUITS MEET FINITE AUTOMATA [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2011, (104): : 45 - 66
- [28] On discretization of delays in timed automata and digital circuits [J]. CONCUR'98: CONCURRENCY THEORY, 1998, 1466 : 470 - 484
- [30] Embedding Arbitrary Boolean Circuits into Fungal Automata [J]. ALGORITHMICA, 2024, 86 (07) : 2069 - 2091