The following pages link to (Q5536277):
Displaying 50 items.
- Operads, quasiorders, and regular languages (Q256333) (← links)
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- A comment on ``Construction of fuzzy automata from fuzzy regular expressions'' (Q529060) (← links)
- Compositional synthesis of asynchronous automata (Q551202) (← links)
- From regular expressions to deterministic automata (Q580983) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Local languages and the Berry-Sethi algorithm (Q672153) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- An efficient recognizer for the Boolean closure of context-free languages (Q802880) (← links)
- Algebraic program analysis (Q832153) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825) (← links)
- Transitive closure and related semiring properties via eliminants (Q1089083) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Theories of automata on \(\omega\)-tapes: a simplified approach (Q1211504) (← links)
- Fuzzy neural networks (Q1213388) (← links)
- The Burnside problem for semigroups (Q1215588) (← links)
- Noiselike transforms of \(\omega\)-events (Q1227706) (← links)
- Semirings and path spaces (Q1254258) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- A matrix-linguistic method of analyzing finite discrete dynamic systems (Q1359297) (← links)
- The validation of SGML content models (Q1370524) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- Controlled pushdown automata (Q1394126) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- The inclusion problem for regular expressions (Q1757837) (← links)
- Construction of fuzzy automata from fuzzy regular expressions (Q1759725) (← links)
- Derivatives of rational expressions with multiplicity (Q1770384) (← links)
- Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- Vacuity in practice: temporal antecedent failure (Q2018060) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond (Q2164000) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- Location based automata for expressions with shuffle (Q2232263) (← links)
- A mesh of automata (Q2272980) (← links)
- On the hierarchy of generalizations of one-unambiguous regular languages (Q2357109) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
