23 citations · 60 across the 17 of their papers we have counts for
4 papers · 1 filter
Formalization of the pumping lemma for context-free languages
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira +1
Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid fo…
A Survey on Operational State Complexity
Yuan Gao, Nelma Moreira, Rogério Reis +1
Descriptional complexity is the study of the conciseness of the various models representing formal languages. The state complexity of a regular language is the size, measured by th…
Symbolic Manipulation of Code Properties
Stavros Konstantinidis, Casey Meijer, Nelma Moreira +1
The FAdo system is a symbolic manipulator of formal languages objects, implemented in Python. In this work, we extend its capabilities by implementing methods to manipulate transdu…
Partial Derivative Automaton for Regular Expressions with Shuffle
Sabine Broda, António Machiavelo, Nelma Moreira +1
We generalize the partial derivative automaton to regular expressions with shuffle and study its size in the worst and in the average case. The number of states of the partial deri…