The following pages link to (Q5541340):
Displaying 50 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Loops and overloops for tree-walking automata (Q442148) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal (Q656586) (← links)
- The operation \(\uparrow\) on formal power series (Q688677) (← links)
- Sequences of words defined by two-way transducers (Q728270) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- The zig-zag power series: A two-way version of the \({}^*\) operator. (Q753497) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- Turing machines and bimachines (Q930927) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- Automates boustrophédon et mots infinis (Q1061503) (← 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)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- Finite-memory automata (Q1341718) (← links)
- Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Query automata over finite trees (Q1607226) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Regular transducer expressions for regular transformations (Q2064527) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Modeling of RNA secondary structures using two-way quantum finite automata (Q2201368) (← links)
- On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
- One-way resynchronizability of word transducers (Q2233399) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Two-way automata versus logarithmic space (Q2254505) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- A characterization of two-way deterministic classes of languages (Q2547802) (← links)
- Der programmierbare endliche Automat. (The programmable finite automaton) (Q2549307) (← links)
- The many faces of a translation (Q2581761) (← links)
- Two-way deterministic automata with jumping mode (Q2661767) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Deciding FO-definability of regular languages (Q2695357) (← links)
- Regular Transformations of Data Words Through Origin Information (Q2811346) (← links)
- Aperiodic String Transducers (Q2817381) (← links)
