Pages that link to "Item:Q5756696"
From MaRDI portal
The following pages link to A Unified Construction of the Glushkov, Follow, and Antimirov Automata (Q5756696):
Displayed 16 items.
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- Fault-tolerant computation of distributed regular path queries (Q1001900) (← links)
- A deterministic parsing algorithm for ambiguous regular expressions (Q2035007) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090) (← links)
- A mesh of automata (Q2272980) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Derived-Term Automata of Multitape Rational Expressions (Q2830207) (← links)
- From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407) (← links)
- Derived-Term Automata for Extended Weighted Rational Expressions (Q3179410) (← links)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- Computing with relational machines (Q5269008) (← links)
- Space-Efficient Representations for Glushkov Automata (Q5384522) (← links)
- The net automaton of a rational expression (Q6109019) (← links)