Pages that link to "Item:Q1575946"
From MaRDI portal
The following pages link to Characterization of Glushkov automata (Q1575946):
Displaying 19 items.
- Series parallel digraphs with loops (Q372966) (← links)
- Sampling different kinds of acyclic automata using Markov chains (Q442144) (← links)
- Acyclic networks maximizing the printing complexity (Q703493) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- Derivatives of rational expressions with multiplicity (Q1770384) (← links)
- Some properties of Ising automata (Q1884924) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- Automata and rational expressions (Q2074204) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- On the hierarchy of generalizations of one-unambiguous regular languages (Q2357109) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- Position Automaton Construction for Regular Expressions with Intersection (Q2817375) (← links)
- On the Hierarchy of Block Deterministic Languages (Q2947409) (← links)
- How expressions can code for automata (Q4680737) (← links)
- Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)
