10 citations · 19 across the 3 of their papers we have counts for
3 papers
Weakly and Strongly Irreversible Regular Languages
Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted…
Minimal and Reduced Reversible Automata
Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the min…
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a…