The following pages link to (Q5541339):
Displayed 50 items.
- Determinization of ordinal automata (Q383176) (← links)
- Rigorous approximated determinization of weighted automata (Q385026) (← links)
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- Algorithms and topology of Cayley graphs for groups. (Q404175) (← links)
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Regular languages with variables on graphs (Q418127) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- Reversal of binary regular languages (Q443743) (← links)
- Postfix automata (Q476910) (← links)
- The dual equivalence of equations and coequations for automata (Q498397) (← links)
- Walking on data words (Q504989) (← links)
- Dynamical systems in categories (Q513904) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- From regular expressions to deterministic automata (Q580983) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- On probabilistic analog automata (Q596111) (← links)
- On stateless deterministic restarting automata (Q611046) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Construction of minimal deterministic finite automata from biological motifs (Q627199) (← links)
- Finite automata theory with membership values in lattices (Q632699) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← 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)
- Nondeterministic fuzzy automata (Q712503) (← links)
- The complexity of asynchronous model based testing (Q714798) (← links)
- Rational relations having a rational trace on each finite intersection of rational relations (Q714813) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- Prefix-primitive annihilators of languages under some operations (Q715048) (← 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)
- Polynomial algorithm for equivalence problem of deterministic multitape finite automata (Q784484) (← links)
- The equivalence problem of multitape finite automata (Q804302) (← links)
- The problem of equivalent transformations for homogeneous multitape automata (Q840024) (← links)
- Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective (Q843994) (← links)