The following pages link to (Q5541339):
Displaying 50 items.
- Finite automata with multiplication (Q1233317) (← links)
- The inclusion problem for simple languages (Q1235014) (← links)
- ``V-tape'', a virtual memory oriented data type, and its resource requirements (Q1238625) (← links)
- Regular subsets in semi-direct products of monoids (Q1240322) (← links)
- One way finite visit automata (Q1242687) (← links)
- Inference for regular bilanguages (Q1242698) (← links)
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes (Q1249573) (← links)
- On two-way sequential transductions of full semi-AFL's (Q1249942) (← links)
- Sequential fuzzy system identification (Q1255466) (← links)
- Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
- The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm (Q1328892) (← links)
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- Finite-memory automata (Q1341718) (← links)
- Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
- Some decisional problems on rational relations (Q1390853) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors (Q1393121) (← links)
- Program schemes, recursion schemes, and formal languages (Q1393937) (← links)
- Controlled pushdown automata (Q1394126) (← links)
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs (Q1566750) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Distances between languages and reflexivity of relations (Q1608895) (← links)
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions (Q1750043) (← links)
- Angelic processes for CSP via the UTP (Q1757156) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Reflections on the phenomenon of Aleksej Andreevich Lyapunov (Q1817095) (← links)
- On the transformation semigroups of finite automata (Q1836302) (← links)
- Polynomial complete problems in automata theory (Q1838038) (← links)
- Ambiguity and decision problems for local adjunct languages (Q1843306) (← links)
- Halbgruppen und Automaten (Q1845093) (← links)
- Automata, Boolean matrices, and ultimate periodicity. (Q1854295) (← links)
- Alternation and bounded concurrency are reverse equivalent. (Q1854297) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine (Q1882901) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Fuzzy grammar theory based on lattices (Q1933786) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
- Effectful applicative similarity for call-by-name lambda calculi (Q1989333) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
