The following pages link to LANGAGE (Q13257):
Displaying 38 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)
- Reducing the time complexity of testing for local threshold testability (Q703505) (← 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)
- Families of locally testable languages (Q1575558) (← links)
- Optimal estimation on the order of local testability of finite automata (Q1575894) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← 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)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet (Q2280321) (← links)
- On the hierarchy of generalizations of one-unambiguous regular languages (Q2357109) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- Position Automaton Construction for Regular Expressions with Intersection (Q2817375) (← links)
- (Q3009551) (← links)
- Efficient weighted expressions conversion (Q3515463) (← links)
- Reducing the Time Complexity of Testing for Local Threshold Testability (Q3559782) (← links)
- A New Family of Regular Operators Fitting with the Position Automaton Computation (Q3599111) (← links)
- Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
- Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
- (Q4418619) (← links)
- (Q4453225) (← links)
- (Q4474160) (← links)
- How expressions can code for automata (Q4680737) (← links)
- (Q4782722) (← links)
- (Q4964807) (← links)
- Weak Inclusion for XML Types (Q5200049) (← links)
- Random Generation of Deterministic Acyclic Automata Using Markov Chains (Q5200053) (← links)
- The Bottom-Up Position Tree Automaton and the Father Automaton (Q5859662) (← links)
