Results 161 to 170 of about 12,979 (182)

27th Annual Computational Neuroscience Meeting (CNS*2018): Part One. [PDF]

BMC Neurosci, 2018
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata

International Journal of Foundations of Computer Science, 2023
We show that the equivalence, unambiguity, and sequentiality problems are decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant and it
openaire   +2 more sources

Observer Construction for Polynomially Ambiguous Max-Plus Automata

IEEE Transactions on Automatic Control, 2022
Aiwen Lai, Sebastien Lahaye, Jan Komenda
exaly  

Diagnosability of Unambiguous Max-Plus Automata

IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2022
Aiwen Lai, Jan Komenda, Sebastien Lahaye
exaly  

Weight-deterministic max-plus automata

IFAC-PapersOnLine, 2022
Jan Komenda
exaly  

A contribution to the determinization of max-plus automata

Discrete Event Dynamic Systems: Theory and Applications, 2020
Sebastien Lahaye, Jan Komenda, Jean-Louis Boimond   +2 more
exaly  

Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics

Discrete Event Dynamic Systems: Theory and Applications, 2021
Lukas Triska
exaly