1 citations · 1 across the 4 of their papers we have counts for
3 papers · 1 filter
Jump Complexity of Deterministic Finite Automata with Translucent Letters
Szilárd Zsolt Fazekas, Victor Mitrana, Andrei Păun +1
We investigate a dynamical complexity measure defined for finite automata with translucent letters (FAwtl). Roughly, this measure counts the minimal number of necessary jumps for s…
On the Degree of Extension of Some Models Defining Non-Regular Languages
Victor Mitrana, Mihaela Păun
This work is a survey of the main results reported for the degree of extension of two models defining non-regular languages, namely the context-free grammar and the extended automa…
{Networks of Uniform Splicing Processors
Victor Mitrana, Mihaela Păun, Jose Angel Sanchez Martin +1
In this note we consider a new variant of network of splicing processors which simplifies the general model such that filters remain associated with nodes but the input and output…