The following pages link to (Q5588675):
Displayed 50 items.
- On the state complexity of reversals of regular languages (Q596099) (← links)
- On equations for regular languages, finite automata, and sequential networks (Q600253) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Implicit language equations: existence and uniqueness of solutions (Q673088) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Finite-state \(\omega\)-languages (Q794443) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note (Q853474) (← links)
- Algebraic properties of substitution on trajectories (Q861260) (← links)
- Language equations with complementation: decision problems (Q880178) (← links)
- Management and analysis of DNA microarray data by using weighted trees (Q925235) (← links)
- Decision problems for language equations (Q972384) (← links)
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization (Q983034) (← links)
- On the closure of pattern expressions languages under intersection with regular languages (Q1015391) (← links)
- On the intersection of regex languages with regular languages (Q1019712) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- Towards a formal proof system for \(\omega\)-rational expressions (Q1064076) (← links)
- Traces, dependency graphs and DNLC grammars (Q1081307) (← links)
- On morphic generation of regular languages (Q1083217) (← links)
- Generalized language equations with multiple solutions (Q1084871) (← links)
- On a representation of tree automata (Q1098636) (← links)
- On the active and full use of memory in right-boundary grammars and push- down automata (Q1099637) (← links)
- Theory of traces (Q1107296) (← links)
- An unpredictability approach to finite-state randomness (Q1117699) (← links)
- Les éléments p-réguliers dans les dioides (Q1135373) (← links)
- On generalized language equations (Q1149791) (← links)
- Applying modal logic (Q1150593) (← links)
- Prefix codes, trees, and automata (Q1217779) (← links)
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata (Q1220389) (← links)
- Ambiguity in the developmental systems of Lindenmayer (Q1221634) (← links)
- Context-free grammars with graph-controlled tables (Q1230666) (← links)
- A note on language equations involving morphisms (Q1249436) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- On well quasi orders of free monoids (Q1275465) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- Language equations over a one-letter alphabet with union, concatenation and star: A complete solution (Q1331941) (← links)
- Unrestricted complementation in language equations over a one-letter alphabet (Q1334656) (← links)
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q1356504) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- Solving systems of explicit language relations (Q1389764) (← links)
- The multiplicative fragment of the Yanov equational theory (Q1399998) (← links)
- Nondeterministic regular expressions as solutions of equational systems. (Q1401324) (← links)
- A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Mergible states in large NFA (Q1763699) (← links)
- Aspects of shuffle and deletion on trajectories (Q1770379) (← links)
- m-recognizability of sets closed under certain affine functions (Q1824406) (← links)
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets (Q1836994) (← links)
- On axioms for commutative regular equations without addition. (Q1853544) (← links)