Login / Signup
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities.
Henning Bordihn
Martin Kutrib
Andreas Malcher
Published in:
Int. J. Found. Comput. Sci. (2015)
Keyphrases
</>
finite automata
communication channels
grammatical inference
regular expressions
probabilistic automata
deterministic automata
upper bound
lower bound
hidden markov models
tree automata
regular languages
sharing information
finite automaton
information sharing
computational model
shared memory