Timo Peichl, Heribert Vollmer  Home/Search
Context Related
| dmtcs.loria.fr/volumes/a...dm040210.pdf 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: dmtcs.loria.fr/vol...dm040210.abs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we look at the tree T M (w) of all computations that automaton M on input w can possibly perform. A node v in this tree is labelled by a configuration C of M at a certain point during its computation on input w, where such a configuration is given by the state of M and the portion of the input which is still unscanned. The children of v in the computation tree are associated with the successor configurations of C, i. e., if the transition function of M has several entries for this... (Update)
Context of citations to this paper: More
.... leaf languages (introduced in [BCS92, Ver93] and examined for different computation models in [HLS 93, JMT96, CMTV98, KSV98, PV99] among others) We survey some results from these areas and establish some new connections. In finite model theory, examinations of the...
Cited by: More
Equivalence Problems for Boolean Constraint Satisfaction - Böhler, Hemaspaandra.. (2001) (Correct)
Lecture Notes for Logic and Interaction - Böhler, Vollmer (2002) (Correct)
Practical Strategies for Hypotheses Elimination on the.. - Buck, Schäfer.. (1999) (Correct)
Similar documents (at the sentence level):
22.8%: Finite Automata with Generalized Acceptance Criteria - Peichl, Vollmer (1999) (Correct)
Active bibliography (related documents): More All
0.5: Generalized Quantifiers in Computational Complexity Theory - Vollmer (1998) (Correct)
0.3: Unambiguous Computations and Locally Definable Acceptance.. - Niedermeier, Rossmanith (1996) (Correct)
0.3: Uniform Characterizations of Complexity Classes of Functions - Kosub, Schmitz, Vollmer (2000) (Correct)
Similar documents based on text: More All
0.5: A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem - Galota, Vollmer (Correct)
0.3: Partially-ordered Two-way Automata: A New.. - Schwentick.. (2001) (Correct)
0.3: Generic Separations and Leaf Languages - Galota, Kosub, Vollmer (2001) (Correct)
Related documents from co-citation: More All
6: Featurebasierte Lokalisation eines autonomen mobilen Roboters (context) - Kluge, Schafer - 1999
4: The complexity of problems de ned by Boolean circuits (context) - Reith, Wagner - 1999
4: Optimal satis ability for propositional calculi and constraint satisfaction prob.. - Reith, Vollmer - 2000
BibTeX entry: (Update)
T. Peichl and H. Vollmer. Finite automata with generalized acceptance criteria. Technical Report 221, Institut fur Informatik, Universitat Wurzburg, 1999. http://citeseer.ist.psu.edu/article/peichl01finite.html More
@article{ peichl99finite,
author = "Timo Peichl and Heribert Vollmer",
title = "Finite Automata with Generalized Acceptance Criteria",
journal = "Lecture Notes in Computer Science",
volume = "1644",
pages = "605--??",
year = "1999",
url = "citeseer.ist.psu.edu/article/peichl01finite.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
951 Computational Complexity (context) - Papadimitriou - 1994 ACM
164 Handbook of Formal Languages (context) - Rozenberg, Salomaa - 1997
60 On uniformity within NC (context) - Barrington, Immerman et al. - 1990
48 Regular languages (context) - Yu - 1997
48 Borel sets and circuit complexity (context) - Sipser - 1983 ACM DBLP
46 Journal of the Association for Computing Machinery (context) - Chandra, Kozen et al. - 1981
43 Bounded-width polynomial size branching programs recognize e.. (context) - Barrington - 1989
38 Nondeterministic NC 1 computation - Caussinus, McKenzie et al. - 1998
34 the power of polynomial time bit-reductions (context) - Hertrampf, Lautemann et al. - 1993
34 A uniform approach to define complexity classes (context) - Bovet, Crescenzi et al. - 1992 ACM DBLP
34 Relativizable and non-relativizable theorems in the polynomi.. - Vereshchagin - 1993
27 Locally definable acceptance types for polynomial time machi.. (context) - Hertrampf - 1992 ACM DBLP
23 Complexity classes defined via k-valued functions (context) - Hertrampf - 1994 DBLP
12 On input read-modes of alternating Turing machines (context) - Cai, Chen - 1995 ACM DBLP
11 Gap-languages and log-time complexity classes - Regan, Vollmer - 1997
10 International Series in Computer Science (context) - Bovet, Crescenzi et al. - 1994
10 Texts in Theoretical Computer Science (context) - azar, az et al. - 1995
4 Information and Computation (context) - Jenner, McKenzie et al. - 1996 DBLP
Documents on the same site (http://dmtcs.loria.fr/volumes/abstracts/dm040210.abs.html):
Finite Automata with Generalized Acceptance Criteria - Peichl, Vollmer (2001) (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