The following pages link to (Q5541339):
Displaying 50 items.
- On formalised computer programs (Q2543556) (← links)
- Equivalences on program schemes (Q2543557) (← links)
- Substitution in families of languages (Q2544191) (← links)
- Tree acceptors and some of their applications (Q2544414) (← links)
- Zur Theorie der nichtdeterministischen und unvollständigen Automaten (Q2544780) (← links)
- Der programmierbare endliche Automat. (The programmable finite automaton) (Q2549307) (← links)
- AFL with the semilinear property (Q2552027) (← links)
- Classification of noncounting events (Q2553949) (← links)
- System identification via state characterization (Q2557198) (← links)
- Free and almost-free subsemigroups of a free semigroup (Q2557798) (← links)
- Solvable classes of discrete dynamic programming (Q2563309) (← links)
- The many faces of a translation (Q2581761) (← links)
- Geodesic growth in virtually abelian groups (Q2659140) (← links)
- Two-way deterministic automata with jumping mode (Q2661767) (← links)
- Both Ways Rational Functions (Q2817380) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Two-Way Automata in Coq (Q2829256) (← links)
- Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
- The Complexity of Languages Resulting from the Concatenation Operation (Q2829979) (← links)
- Stone Duality and the Recognisable Languages over an Algebra (Q2888490) (← links)
- Programs=data=first-class citizens in a computational world (Q2941589) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Kleene closure and state complexity (Q2956884) (← links)
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts (Q2969980) (← links)
- Two-way representations and weighted automata (Q2969983) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- A state space approach to the finite automata (Q3038626) (← links)
- Better Hyper-minimization (Q3073639) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- (Q3165665) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Transfer of Model Checking to Industrial Practice (Q3176381) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- Some Remarks on Abstract Machines (Q3275833) (← links)
- Weak Second‐Order Arithmetic and Finite Automata (Q3287248) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
- Decision problems among the main subfamilies of rational relations (Q3431438) (← links)
- Loops in automata and HDTOL relations (Q3479541) (← links)
- On Stateless Deterministic Restarting Automata (Q3599085) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Tighter Bounds for the Determinisation of Büchi Automata (Q3617728) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Converting Self-verifying Automata into Deterministic Automata (Q3618603) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Powers of Regular Languages (Q3637227) (← links)
- Magic Numbers and Ternary Alphabet (Q3637234) (← links)
