The word problem distinguishes counter languages
, 2006 Counter automata are more powerful versions of finite-state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters.
Cleary, Sean +2 more
core +1 more source
Decomposing user-defined tasks in a reinforcement learning setup using TextWorld. [PDF]
Front Robot AI, 2023 Petsanis T +4 more
europepmc +1 more source
Specification decomposition for reactive synthesis. [PDF]
Innov Syst Softw Eng, 2023 Finkbeiner B, Geier G, Passing N.
europepmc +1 more source
Decision Trees for Binary Subword-Closed Languages. [PDF]
Entropy (Basel), 2023 Moshkov M.
europepmc +1 more source
Compositional synthesis of modular systems. [PDF]
Innov Syst Softw Eng, 2022 Finkbeiner B, Passing N.
europepmc +1 more source
Safe Decision Controller for Autonomous DrivingBased on Deep Reinforcement Learning inNondeterministic Environment. [PDF]
Sensors (Basel), 2023 Chen H, Zhang Y, Bhatti UA, Huang M.
europepmc +1 more source
Vector Symbolic Architectures as a Computing Framework for Emerging Hardware. [PDF]
Proc IEEE Inst Electr Electron Eng, 2022 Kleyko D +10 more
europepmc +1 more source
Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems. [PDF]
Sci Prog, 2021 Cheng L, Feng L, Li Z.
europepmc +1 more source
Canonicalizing BigSMILES for Polymers with Defined Backbones. [PDF]
ACS Polym Au, 2022 Lin TS +4 more
europepmc +1 more source
An enactivist-inspired mathematical model of cognition. [PDF]
Front Neurorobot, 2022 Weinstein V, Sakcak B, LaValle SM.
europepmc +1 more source