Acta cybernetica, Volume 12

A-free a₁ accepting algorithm alphabet applied arbitrary automata automaton axiom binary CD grammar systems CDGS closed sets communicating grammar systems compact elements component Computer Science consider construct contains context context-free context-sensitive context-sensitive languages Corollary Csuhaj-Varjú current sentential form Dassow defined Definition denoted derivation deterministic dttr family of languages formal language function graph Hence Hungary hybrid hybrid CD intersection property L₁ Lemma Lgen linear matrix grammars minimal clone mode monodependent nonterminal NP-complete obtain operation P₁ P₂ parallel communicating parallel communicating grammar Păun PC grammar Petri nets prescribed team problem productions Proof Proposition prove query symbols recursively enumerable languages regular language relation respect rules S₁ satisfies the intersection sch(R semantics sentential form sequence set of FDs simulated string subset Szeged t₁ terminal test tube systems Theorem top-down tree word