Wolfgang Thomas  Home/Search
Context Related
| informatik.unikiel.de/~t...lille.ps.gz i7.informatik.rwthaachen...lille.ps.gz falbala.informatik.uniki...lille.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: informatik.unikie...publications (more) From: falbala.informatik...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The paper reviews recent results which aim at generalizing finite automata theory from words and trees to labelled partial orders (presented as labelled directed acyclic graphs), with an emphasis on logical aspects. As an important type of labelled partial order we consider pictures (two-dimensional words). Graph acceptors and their specialization for pictures, "tiling systems", are presented, and their equivalence to existential monadic second-order logic is reviewed. Other restricted... (Update)
Similar documents based on text: More All
0.1: Nonsurgical Female Sterilization With Quinacrine Pellets - Malaysian Experience Hamid (Correct)
0.1: Oracles and Quantifiers - Frick (1997) (Correct)
0.1: Network Optimizations for Large Vocabulary Speech Recognition - Mohri, Riley (1998) (Correct)
Related documents from co-citation: More All
8: Elements of an automata theory over partial orders - Thomas - 1996
6: Model-theoretic methods in the study of elementary logic (context) - Hanf - 1965
5: Reachability is harder for directed than for undirected finite graphs (context) - Ajtai, Fagin - 1990
BibTeX entry: (Update)
W. Thomas. Automata theory on trees and partial orders. In M. Bidoit and M. Dauchet, editors, Proc. TAPSOFT'97, number 1214 in Lecture Notes in Computer Science, pages 20--38. Springer, 1997. http://citeseer.ist.psu.edu/thomas97automata.html More
@inproceedings{ thomas97automata,
author = "W. Thomas",
title = "Automata Theory on Trees and Partial Orders",
booktitle = "Proc. 7th International Joint Conference {CAAP}/{FASE}: Theory and Practice of Software Development ({TAPSOFT}'97)",
volume = "1214",
publisher = "Springer-Verlag, Berlin",
address = "Lille, France",
pages = "20--34",
year = "1997",
url = "citeseer.ist.psu.edu/thomas97automata.html" }
Citations (may not include all citations):294 Finite Model Theory (context) - Ebbinghaus, Flum - 1995
241 Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
103 Tree acceptors and some of their applications (context) - Doner - 1970
65 World Scientific (context) - Diekert, Rozenberg et al. - 1995
64 The monadic second-order logic of graphs I: recognizable set.. (context) - Courcelle - 1990
58 The expression of graph properties and graph transformations.. - Courcelle - 1996
53 automata and logic (context) - Thomas
32 Two-dimensional languages - Giammarresi, Restivo
31 Generalized finite automata with an application to a decisio.. (context) - Thatcher, Wright - 1968
25 Monadic generalized spectra (context) - Fagin - 1975
18 The monadic quantifier alternation hierarchy over graphs is .. - Matz, Thomas - 1996
18 and automata (context) - Thomas, logics - 1991
15 Monadic second-order logic over rectangular pictures and rec.. (context) - Giammarresi, Restivo et al. - 1996
13 Parallel and two-way automata on directed ordered acyclic gr.. (context) - Kamimura, Slutzki - 1981
13 Elements of an automata theory over partial orders - Thomas
8 Interpretability and tree automata: a simple way to solve al.. - Seese - 1992
7 Akad'emiai Kiod'o (context) - G'ecseg, Steinby et al. - 1984
5 A Kleene Theorem for a class of planar acyclic graphs (context) - Bossut, Dauchet et al. - 1995
5 Nondeterminism versus determinism of finite automata over di.. - Potthoff, Seibert et al. - 1994
2 On monadic NP versus monadic co-NP (context) - Fagin, Stockmeyer et al. - 1995
2 The monadic second-order theory of graphs II: Infinite graph.. (context) - Courcelle - 1989
1 Finite automata accepting animals and lower sets (context) - Sperber - 1986
1 Context-sensitive languages and recognizable picture languag.. (context) - Latteux, Simplot
1 Some properties of two-dimensional tessellation acceptors (context) - Inoue, Nakamura - 1977
1 Erlangen-Nurnberg (context) - Sperber, Dissertation - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-kiel.de/inf/Thomas/publications.html): More
Omega - System Report - Ackermann, Thomas, Ulbrand, Vöge (1997) (Correct)
An Algorithmic Approach for Checking Closure Properties of .. - Peled, Wilke, Wolper (1998) (Correct)
Singleton Acceptance Conditions in -Automata - Leoniuk, Lescow, Thomas (1998) (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