The following pages link to Giovanna J. Lavado (Q388215):
Displaying 10 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Concise representations of reversible automata (Q2401006) (← links)
- Minimal and Reduced Reversible Automata (Q2829980) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (Q3167503) (← links)
- (Q4609331) (← links)
- (Q5016365) (← links)
- Concise Representations of Reversible Automata (Q5205047) (← links)
- Operational State Complexity under Parikh Equivalence (Q5496197) (← links)
- Weakly and Strongly Irreversible Regular Languages (Q6114869) (← links)
