The following pages link to Nelma Moreira (Q498391):
Displaying 50 items.
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- Optimal state reductions of automata with partially specified behaviors (Q728283) (← links)
- Regular expressions and transducers over alphabet-invariant and user-defined labels (Q1616950) (← links)
- Automata for regular expressions with shuffle (Q1706150) (← links)
- On the size of partial derivatives and the word membership problem (Q2041687) (← links)
- On the uniform distribution of regular expressions (Q2096580) (← links)
- Partial derivative automaton by compressing regular expressions (Q2096587) (← links)
- Approximate NFA universality motivated by information theory (Q2112188) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Location based automata for expressions with shuffle (Q2232263) (← links)
- A mesh of automata (Q2272980) (← links)
- Some applications of the formalization of the pumping lemma for context-free languages (Q2333674) (← links)
- Deciding Kleene algebra terms equivalence in Coq (Q2347910) (← links)
- On the average complexity of strong star normal form (Q2400991) (← links)
- On the mother of all automata: the position automaton (Q2408798) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- Enumeration and generation with a string automata representation (Q2465040) (← links)
- Location automata for synchronised shuffle expressions (Q2693294) (← links)
- On the average complexity of partial derivative transducers (Q2699218) (← links)
- Position Automaton Construction for Regular Expressions with Intersection (Q2817375) (← links)
- (Q2819377) (← links)
- On the Formalization of Some Results of Context-Free Language Theory (Q2820703) (← links)
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (Q2829969) (← links)
- Implementation of Code Properties via Transducers (Q2830220) (← links)
- On the Average Size of Glushkov and Equation Automata for KAT Expressions (Q2842774) (← links)
- ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH (Q2909097) (← links)
- Deciding Regular Expressions (In-)Equivalence in Coq (Q2915138) (← links)
- Incomplete Transition Complexity of Some Basic Operations (Q2927656) (← links)
- (Q3024029) (← links)
- Incremental DFA Minimisation (Q3073619) (← links)
- Partial Derivative Automata Formalized in Coq (Q3073622) (← links)
- Partial Derivative and Position Bisimilarity Automata (Q3192270) (← links)
- Prefix and Right-Partial Derivative Automata (Q3195704) (← links)
- On the Average State Complexity of Partial Derivative Transducers (Q3297766) (← links)
- ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED (Q3395137) (← links)
- EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA (Q3526533) (← links)
- On the Average Number of States of Partial Derivative Automata (Q3584886) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- Formal Modelling of Emotions in BDI Agents (Q3602941) (← links)
- Series-Parallel Automata and Short Regular Expressions (Q3633925) (← links)
- Distinguishability Operations and Closures (Q4589234) (← links)
- (Q4590910) (← links)
- (Q4609326) (← links)
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA (Q4902888) (← links)
- (Q4964020) (← links)
- (Q4967184) (← links)
- (Q4986510) (← links)
- (Q5061515) (← links)
- (Q5146514) (← links)
- Incremental DFA minimisation (Q5166502) (← links)
