Thomas Schwentick, Denis Thérien, Heribert Vollmer  Home/Search
Context Related
| cs.mcgill.ca/~denis/paper...scthvo.ps info4.informatik.uniwuer...tr274.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.mcgill.ca/~denis/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we consider nite automata with the restriction that whenever the automaton leaves a state it never returns to it. (Update)
Similar documents based on text: More All
3.0: Partially-ordered Two-way Automata: A New.. - Schwentick.. (2001) (Correct)
0.7: Presentations of the Schützenberger product of n groups - Gomes, Pin, Sezinando (2001) (Correct)
0.6: The Many Faces of a Translation - McKenzie, Schwentick.. (2000) (Correct)
Related documents from co-citation: More All
4: The complexity of problems de ned by Boolean circuits (context) - Reith, Wagner - 1999
4: Featurebasierte Lokalisation eines autonomen mobilen Roboters (context) - Kluge, Schafer - 1999
4: Optimal satis ability for propositional calculi and constraint satisfaction prob.. - Reith, Vollmer - 2000
BibTeX entry: (Update)
T. Schwentick, D. Therien, H. Vollmer. Partially-ordered Two-way Automata: A New Characterization of DA. Marz 2001. http://citeseer.ist.psu.edu/schwentick01partiallyordered.html More
@inproceedings{ schwentick01partiallyordered,
author = "Thomas Schwentick and Denis Therien and Heribert Vollmer",
title = "Partially-Ordered Two-Way Automata: A New Characterization of {DA}",
booktitle = "Developments in Language Theory",
pages = "239-250",
year = "2001",
url = "citeseer.ist.psu.edu/schwentick01partiallyordered.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
121 and Machines (context) - Eilenberg, Languages - 1976
63 Varieties of Formal Languages (context) - Pin - 1986
57 and Circuit Complexity (context) - Straubing, Formal - 1994
28 Syntactic semigroups - Pin - 1997
23 Theory of Computing Systems (context) - Pin, Weil et al. - 1997
22 Complexity results for two-way and multipebble automata and .. - Globerman, Harel - 1996
6 two variables are as powerful as one quanti er alternation: .. (context) - Th, Wilke - 1998
4 Sur le produit de concatenation non ambigu (context) - Sch - 1976
4 Concatenation of inputs in a two-way automaton (context) - Birget - 1989
3 Two-way nite state transducers and monadic second-order logi.. (context) - Engelfriet, Hoogeboom - 1999
3 eration polynomiales et hierarchies de concatenation (context) - Ar - 1991
3 Two-way deterministic nite automata are exponentially more s.. (context) - Micali - 1981
3 Two-way - nite automata (context) - Hromkovic, Schnitger et al. - 1999
2 Positional simulation of two-way automata: Proof of a conjec.. (context) - Birget - 1992
Documents on the same site (http://www.cs.mcgill.ca/~denis/): More
Over Words, Two Variables Are as Powerful as One Quantifier.. - Therien, Wilke (1998) (Correct)
Around the PCP Theorem - Arora (1997) (Correct)
An Algebraic Approach to Data Languages and Timed Languages - Bouyer, Petit.. (2003) (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