Pages that link to "Item:Q672153"
From MaRDI portal
The following pages link to Local languages and the Berry-Sethi algorithm (Q672153):
Displayed 20 items.
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Efficient recognition of trace languages defined by repeat-until loops (Q989291) (← links)
- Families of locally testable languages (Q1575558) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- Shuffle on positive varieties of languages (Q1884959) (← links)
- A deterministic parsing algorithm for ambiguous regular expressions (Q2035007) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES (Q2841978) (← links)
- From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407) (← links)
- Infinite Arrays and Domino Systems (Q3438930) (← links)
- Traces of Control-Flow Graphs (Q3637222) (← links)
- How expressions can code for automata (Q4680737) (← links)
- From regular expressions to finite automata<sup>∗</sup> (Q4944659) (← links)
- (Q4964807) (← links)
- Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- One-unambiguous regular languages (Q5906893) (← links)