scientific article
From MaRDI portal
Publication:4057601
zbMath0302.68069MaRDI QIDQ4057601
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item ⋮ Nondeterministic operational complexity in subregular languages ⋮ Merging two hierarchies of external contextual grammars with subregular selection ⋮ Relations of contextual grammars with strictly locally testable selection languages ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ Nondeterministic state complexity of star-free languages ⋮ Unnamed Item ⋮ Generative Capacity of Contextual Grammars with Subregular Selection Languages* ⋮ Determination of finite automata accepting subregular languages ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ Wheeler languages ⋮ Closure properties of subregular languages under operations ⋮ Accepting networks of evolutionary processors with resources restricted and structure limited filters ⋮ Operations on subregular languages and nondeterministic state complexity
