One-Way Automata Moshe Y. Vardi + IBM Almaden Research Center  Home/Search
Context
Related
| rice.edu/~vardi/papers/ipl88rj.ps.gz From: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis. 1 (Update)
Active bibliography (related documents): More All
0.0: On the Power of Quantum Finite State Automata - Kondacs, Watrous (1997) (Correct)
0.0: Some Automata-Theoretic Properties of ∩-nfa - van Zijl (1999) (Correct)
0.0: A Temporal Fixpoint Calculus (Extended Abstract) - Vardi (Correct)
Similar documents based on text: More All
0.2: Two-Way Equational Tree Automata for AC-like Theories.. - Verma (2003) (Correct)
0.2: Extended Temporal Logic Revisited - Kupferman, Piterman, Vardi (2001) (Correct)
0.2: View-based Query Processing for Regular Path Queries.. - Calvanese, De Giacomo, .. (2000) (Correct)
BibTeX entry: (Update)
@misc{ moshe-note,
author = "One-Way Automata Moshe",
title = "A Note on the Reduction of Two-Way Automata to",
url = "citeseer.ist.psu.edu/736084.html" }
Citations (may not include all citations):96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
35 Decidable Optimization Problems for Database Logic Programs (context) - Cosmadakis, Gaifman et al. - 1988
23 The reduction of two-way automata to one-way automata (context) - Shepherdson - 1959
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC