Decomposition and factorization of chemical reaction transducers
From MaRDI portal
Publication:2422041
DOI10.1016/j.tcs.2019.01.032zbMath1425.68112OpenAlexW2912247953MaRDI QIDQ2422041
Takashi Yokomori, Fumiya Okubo
Publication date: 18 June 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.032
decomposition theoremchemical reaction automatachemical reaction transducersmultiset-based computing
Related Items
On the computational power of swarm automata using agents with position information ⋮ Theory of reaction automata: a survey
Cites Work
- Reaction automata
- On the properties of language classes defined by bounded reaction automata
- Nivat's theorem for pushdown transducers
- Transductions des langages de Chomsky
- The computational capability of chemical reaction automata
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic
- Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy
- Probabilistic Automata and Probabilistic Logic
- P and dP Automata: A Survey
- Properties of Finite and Pushdown Transducers
- Practical decomposition of automata
- Morphic Characterizations of Language Families Based on Local and Star Languages
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
- A Nivat Theorem for Quantitative Automata on Unranked Trees
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Preservation of languages by transducers
- Symbolic analysis of a decomposition of information processing machines
- Pushdown automata, multiset automata, and Petri nets
- Multiset processing. Mathematical, computer science, and molecular computing points of view
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
