Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Landweber (1967)
Finite state games — a solvability algorithm for restricted second-order arithmeticNotices Amer. Math. Soc., 14
Mustapha Arfi (1991)
Polynomial operations and hierarchies of concatenation (in French)Theoretical Computer Science, 91
D. Cowan (1993)
Inverse Monoids of dot-Depth TwoInt. J. Algebra Comput., 3
Mustapha Arfi (1987)
Polynomial Operations on Rational Languages
P. Weil (1993)
Some results on the dot-depth hierarchySemigroup Forum, 46
J.-E. Pin (1984)
Hiérarchies de concaténationRAIRO Inform. Théor., 18
J. Stern (1985)
Complexity of Some Problems from the Theory of AutomataInf. Control., 66
D. Perrin (1984)
Recent Results on Automata and Infinite Words
T. Wilke (1991)
Proc. 18th ICALP Conf.
(1984)
Vari et es de langages formels, Masson, Paris; English translation: 1986, Varieties of formal languages
H. Straubing, D. Thérien (1985)
Partially ordered finite monoids and a theorem of I. SimonJ. Algebra, 119
T. Wilke (1993)
Locally Threshold Testable Languages of Infinite Words
D. Perrin (1984)
Mathematical Foundations of Computer Science
E. Emerson (1991)
Temporal and Modal Logic
M. Schützenberger (1965)
On Finite Monoids Having Only Trivial SubgroupsInf. Control., 8
Howard Straubing (1988)
Semigroups and Languages of Dot-Depth TwoTheor. Comput. Sci., 58
J. Brzozowski, Imre Simon (1971)
Characterizations of locally testable events
N. Immerman (1988)
Nondeterministic space is closed under complementation[1988] Proceedings. Structure in Complexity Theory Third Annual Conference
J. Pécuchet (1986)
Variétés de Semis Groupes et Mots Infinis
G. Lallement (1979)
Semigroups and combinatorial applications
D. Cowan (1993)
Inverse monoids of dot-depth 2Int. J. Alg. Comp., 3
R. McNaughton (1974)
Algebraic decision procedures for local testabilityMathematical systems theory, 8
Danièle Girault-Beauquier (1984)
Bilimites de langages reconnaissablesTheoretical Computer Science, 33
T. Wilke (1993)
An Algebraic Theory for Regular Languages of Finite and Infinite WordsInt. J. Algebra Comput., 3
I. Simon (1975)
Proc. 2nd GI Conf.
H. Gaifman (1982)
On Local and Non-Local PropertiesStudies in logic and the foundations of mathematics, 107
J.A. Brzozowski, I. Simon (1973)
Characterizations of locally testable languagesDiscr. Math., 4
W. Thomas (1991)
Automata on Infinite Objects
Th. Wilke (1993)
STACS 93
L. Stockmeyer (1976)
The Polynomial-Time HierarchyTheor. Comput. Sci., 3
J. Leeuwen (1990)
Handbook of Theoretical Computer Science
L. Landweber (1969)
Decision problems forω-automataMathematical systems theory, 3
J. Stern (1985)
Characterizations of Some Classes of Regular EventsTheor. Comput. Sci., 35
P. Weil (1988)
Inverse monoids and the dot -depth hierarchy
Ronald Fagin (1974)
Generalized first-order spectra, and polynomial. time recognizable sets
A. Semenov (1980)
ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERSMathematics of The Ussr-izvestiya, 15
J. Brzozowski, Robert Knast (1978)
The Dot-Depth Hierarchy of Star-Free Languages is InfiniteJ. Comput. Syst. Sci., 16
M. Arfi (1987)
Polynomials operations and relational languages,4th STACSLecture Notes in Computer Science, 247
Róbert Szelepcsényi (1988)
The method of forced enumeration for nondeterministic automataActa Informatica, 26
C. Elgot (1962)
Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 98
Sang Cho, D. Huynh (1991)
Finite-Automaton Aperiodicity is PSPACE-CompleteTheor. Comput. Sci., 88
J.-E. Pin, P. Weil (1995)
Proc. 22nd ICALP
N. Immerman (1988)
Nondeterministic space is closed under complementSIAM J. Comput., 17
K. Compton (1983)
ON RICH WORDS
D. Beauquier, M. Nivat (1985)
About Rational Sets of Factors of a Bi-Infinite Word
(1991)
Op6rations polynomiales et hi6rarchies de concat6nation
R. McNaughton (1966)
Testing and Generating Infinite Sequences by a Finite AutomatonInf. Control., 9
D. Perrin (1983)
Varietes de Semigroupes et Mots Infinis
Joëlle Cohen-Chesnot (1991)
On the Expressive Power of Temporal Logic for Infinite WordsTheor. Comput. Sci., 83
S. Kleene (1951)
Representation of Events in Nerve Nets and Finite Automata
M. Nivat, D. Perrin (1982)
Ensembles reconnaissables de mots biinfinisCanadian Journal of Mathematics, 38
F. Ramsey
On a Problem of Formal LogicProceedings of The London Mathematical Society
D. Thérien, Alex Weiss (1985)
Graph congruences and wreath productsJournal of Pure and Applied Algebra, 36
J.R. Büchi (1960)
Weak second-order arithmetic and finite automataZ. Math. Logik und Grundl. Math., 6
(1967)
Finite state games -A solvability algorithm for restricted secondorder arithmetic, Notices Amer
S. Eilenberg (1974)
Automata, Languages and Machines, Vol. A
W. Thomas (1982)
Classifying Regular Events in Symbolic LogicJ. Comput. Syst. Sci., 25
J. Büchi, Lawrence Landweber (1969)
Definability in the monadic second-order theory of successorJournal of Symbolic Logic, 34
D. Gabbay, A. Pnueli, S. Shelah, J. Stavi (1980)
On the temporal analysis of fairness
W. Thomas (1981)
A Combinatorial Approach to the Theory of omega-AutomataInf. Control., 48
L. Stockmeyer, A. Meyer (1973)
Word problems requiring exponential time(Preliminary Report)Proceedings of the fifth annual ACM symposium on Theory of computing
A.R. Meyer (1975)
Proc. Boston University Logic Colloquium
W. Thomas (1993)
TAPSOFT '93
R. McNaughton, S. Papert (1971)
Counter-Free Automata
D. Perrin, P. Schupp (1986)
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories
Joëlle Cohen, D. Perrin, J. Pin (1993)
On the Expressive Power of Temporal LogicJ. Comput. Syst. Sci., 46
J. Justin, G. Pirillo (1986)
On a natural extension of Jacob's ranksJ. Comb. Theory, Ser. A, 43
Danièle Beauquier (1984)
Ensembles reconnaissables de mots bi -infinis limite et déterminisme
S. Sieber (1960)
On a decision method in restricted second-order arithmetic
B.R. Hodgson (1983)
Décidabilité par automate finiAnn. Sci. Math. Québec, 7
Imre Simon (1990)
Factorization Forests of Finite HeightTheor. Comput. Sci., 72
Imre Simon (1975)
Piecewise testable events
J. Pin, P. Weil (1995)
Polynomial closure and unambiguous productTheory of Computing Systems, 30
R. Ladner (1977)
Application of Model Theoretic Games to Discrete Linear Orders and Finite AutomataInf. Control., 33
C. Michaux, F. Point (1986)
Les ensemblesk-reconnaissables sont définissables dans (ℕ, +,V k )C.R. Acad. Sci. Paris, 303
A. Arnold (1985)
A syntactic congruence for rational ω-languagesTheor. Comput. Sci., 39
A. Meyer (1973)
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
W. Thomas (1993)
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
D. Beauquier, J. Pin (1991)
Languages and ScannersTheor. Comput. Sci., 84
J. Pin, Howard Straubing (1981)
Monoids of upper-triangular matrices
D. Perrin, J. Pin (1986)
First-Order Logic and Star-Free SetsJ. Comput. Syst. Sci., 32
J. Pin (1984)
Hiérarchies de ConcaténationRAIRO Theor. Informatics Appl., 18
T. Wilke (1991)
An Eilenberg Theorem for Infinity-Languages
Rana Barua, Kishan Gupta (1958)
Finite AutomataPhilosophy, 33
D. Perrin (1984)
An introduction to automata on infinite wordsLecture Notes in Computer Science, 192
Howard Straubing, D. Thérien, W. Thomas (1988)
regular Languages Defined with Generalized Quantifiers
J.-E. Pin, H. Straubing (1981)
Colloquia Mathematica Societatis Janos Bolyai 39
P. Weil (1989)
Inverse monoids of dot-depth twoTheor. Comput. Sci., 66
Ronald Fagin (1990)
Finite-Model Theory - A Personal Perspective
W. Thomas (1979)
Star-free regular sets of ω-sequencesInform. Contr., 42
Howard Straubing, D. Thérien (1988)
Partially ordered finite monoids and a theorem of I
N. Immerman (1987)
Languages that Capture Complexity ClassesSIAM J. Comput., 16
H. Gaifman (1982)
Proc. Herbrandt Symposium, Logic Colloquium '81
S.C. Kleene (1956)
Automata Studies
W. Thomas (1981)
A combinatorial approach to the theory of ω-automataInform. Contr., 48
J. Kamp (1968)
Tense logic and the theory of linear order
J. Büchi (1960)
Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 6
J. Almeida (1991)
Implicit operations on finite J-trivial semigroups and a conjecture of I. SimonJournal of Pure and Applied Algebra, 69
D. Beauquier, J. Pin (1989)
Factors of Words
J.R. Büchi (1962)
Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science
D. Siefkes (1970)
Büchi's monadic second order successor arithmetic
D. Beauquier (1985)
Ensembles reconnaissables de mots bi-infinisLecture Notes in Computer Science, 192
J.-E. Pin (1984)
Variétés de Langages Formels
A. Arnold (1985)
A Syntactic Congruence for Rational omega-LanguageTheor. Comput. Sci., 39
(1980)
Hodgson , D 6 cidabilit 6 par automate fini , Ann
Jean-Pierre Péchuchet (1986)
Etude Syntaxique des Parties Reconnaissables de Mots Infinis
Howard Straubing (1979)
Aperiodic homomorphisms and the concatenation product of recognizable setsJournal of Pure and Applied Algebra, 15
W. Thomas (1979)
Star-Free Regular Sets of omega-SequencesInf. Control., 42
W. Quine (1946)
Concatenation as a basis for arithmeticJournal of Symbolic Logic, 11
Lect. Notes in Comp. Sci
S. Eilenberg (1974)
Automata, languages, and machines. A
Howard Straubing, P. Weil (1992)
On a Conjecture Concerning Dot-Depth Two LanguagesTheor. Comput. Sci., 104
W. Thomas (1991)
On Logics, Tilings, and Automata
Danièle Beauquier (1984)
Bilimites de Langages ReconnaissablesTheor. Comput. Sci., 33
This is a survey article on the connections between the “sequential calculus” of Büchi, a system which allows to formalize properties of words, and the theory of automata. In the sequential calculus, there is a predicate for each letter and the unique extra non logical predicate is the relation symbol <, which is interpreted as the usual order on the integers. Several famous classes have been classified within this logic. We briefly review the main results concerning second order, which covers classes like PH, NP, P, etc., and then study in more detail the results concerning the monadic second-order and first-order logic. In particular, we survey the results and fascinating open problems dealing with the first-order quantifier hierarchy. We also discuss the first-order logic of one successor and the linear temporal logic. There are in fact three levels of results, since these logics can be interpreted on finite words, infinite words or bi-infinite words. The paper is self-contained. In particular, the necessary background on automata and finite semigroups is presented in a long introductory section, which includes some very recent results on the algebraic theory of infinite words.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Aug 13, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.