Pages that link to "Item:Q1116341"

The following pages link to A note on the reduction of two-way automata to one-way automata (Q1116341):

Displaying 24 items.

• State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
• On the state complexity of operations on two-way finite automata (Q515574) (← links)
• On the complexity of typechecking top-down XML transformations (Q555775) (← links)
• The zig-zag power series: A two-way version of the \({}^*\) operator. (Q753497) (← links)
• View-based query processing: on the relationship between rewriting, answering and losslessness (Q870266) (← links)
• On regular temporal logics with past (Q977176) (← links)
• Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
• From bidirectionality to alternation. (Q1401248) (← links)
• Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
• Simple picture processing based on finite automata and regular grammars (Q1747512) (← links)
• New size hierarchies for two way automata (Q1992112) (← links)
• Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
• On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
• Complementing two-way finite automata (Q2643079) (← links)
• Deciding FO-definability of regular languages (Q2695357) (← links)
• Two-Way Automata in Coq (Q2829256) (← links)
• From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
• Semantic Acyclicity on Graph Databases (Q3187172) (← links)
• A more efficient notion of zigzag stability (Q4717039) (← links)
• (Q5089281) (← links)
• Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
• State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
• Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
• On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)