Pages that link to "Item:Q2800411"
From MaRDI portal
The following pages link to From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411):
Displaying 8 items.
- A deterministic parsing algorithm for ambiguous regular expressions (Q2035007) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- A mesh of automata (Q2272980) (← links)
- Natural strategic ability (Q2289013) (← links)
- A logic for document spanners (Q2322723) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
