The following pages link to (Q5541339):
Displayed 50 items.
- From regular expressions to deterministic automata (Q580983) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- On probabilistic analog automata (Q596111) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- Regular languages and Stone duality (Q675860) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- The operation \(\uparrow\) on formal power series (Q688677) (← links)
- Rewriting of regular expressions and regular path queries (Q696951) (← links)
- The zig-zag power series: A two-way version of the \({}^*\) operator. (Q753497) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- The equivalence problem for deterministic two-tape automata (Q758956) (← links)
- The equivalence problem of multitape finite automata (Q804302) (← links)
- On size reduction techniques for multitape automata (Q860868) (← links)
- Endmarkers can make a difference (Q911789) (← links)
- Parallel complexity of the regular code problem (Q913513) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- The equivalence problem of multidimensional multitape automata (Q955343) (← links)
- The inclusion problem for some classes of deterministic multitape automata (Q1056540) (← links)
- Equivalence of infinite behavior of finite automata (Q1060562) (← links)
- A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\) (Q1069312) (← links)
- Notes on finitely generated semigroups and pumping conditions for regular languages (Q1084511) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Finite automata and unary languages (Q1099644) (← links)
- On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303) (← links)
- Concatenation of inputs in a two-way automaton (Q1115636) (← links)
- A note on the reduction of two-way automata to one-way automata (Q1116341) (← links)
- Complementing deterministic Büchi automata in polynomial time (Q1116702) (← links)
- Simple counter machines and number-theoretic problems (Q1136223) (← links)
- A hierarchy of deterministic languages (Q1136238) (← links)
- Vector addition systems and regular languages (Q1146002) (← links)
- On inclusion problem for deterministic multitape automata (Q1146516) (← links)
- A note on decision problems for three-way two-dimensional finite automata (Q1149774) (← links)
- Quasiidentities in a free semigroup (Q1159774) (← links)
- Projections of languages recognizable by probabilistic and alternating finite multitape automata (Q1167542) (← links)
- Automatic groups and amalgams (Q1183379) (← links)
- Minimisation of acyclic deterministic automata in linear time (Q1190464) (← links)
- Finite automata on directed graphs (Q1191024) (← links)
- Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- Theories of automata on \(\omega\)-tapes: a simplified approach (Q1211504) (← links)
- Fuzzy neural networks (Q1213388) (← links)
- Some free submonoids of the free monoid of prefix codes (Q1215352) (← links)
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata (Q1220389) (← links)
- Adjoint machines, state-behavior machines, and duality (Q1224156) (← links)
- Sequentielle Analyse kontextfreier Sprachen (Q1226393) (← links)
- Fuzzy automata and languages (Q1229840) (← links)
- A characterization of automata and a direct product decomposition (Q1230609) (← links)