2 papers
cs.FL2026
Parallel Communicating Finite Automata: The Non-Forgetting Model
Jana Schulz
Parallel Communicating Finite Automata (PCFA) are systems of several finite automata that can communicate by requesting the state of another automaton. As an attempt to make PCFA a…
cs.FL2026
Forbidden-Context & Ordered Grammar Systems
Henning Fernau, Lakshmanan Kuppusamy, Jana Schulz
In this paper, we consider combining the ideas of forbidden random context grammars as well as of ordered grammars with cooperating distributed grammar systems (CDGS). We focus on…