메뉴 건너뛰기




Volumn 36, Issue 1, 2003, Pages 29-69

Regular languages defined by generalized first-order formulas with a bounded number of bound variables

Author keywords

[No Author keywords available]

Indexed keywords

MODULAR QUANTIFIERS;

EID: 0037593902     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1035-9     Document Type: Article
Times cited : (12)

References (30)
  • 1
    • 0030519219 scopus 로고    scopus 로고
    • A syntactical proof of the locality of DA
    • J. Almeida, A Syntactical Proof of the Locality of DA, Internat. J. Algebra Comput. 6 (1996), 165-178.
    • (1996) Internat. J. Algebra Comput. , vol.6 , pp. 165-178
    • Almeida, J.1
  • 2
    • 85029514966 scopus 로고
    • Factors of words
    • Proc. 16th ICALP, Springer-Verlag, Berlin
    • D. Beauquier and J. E. Pin, Factors of Words, Proc. 16th ICALP, pp. 63-79, Lecture Notes in Computer Science 372, Springer-Verlag, Berlin, 1989.
    • (1989) Lecture Notes in Computer Science , vol.372 , pp. 63-79
    • Beauquier, D.1    Pin, J.E.2
  • 7
    • 0024771254 scopus 로고
    • Definability with a bounded number of bound variables
    • N. Immerman and D. Kozen, Definability with a Bounded Number of Bound Variables, Inform. and Comput. 83 (1989), 121-139.
    • (1989) Inform. and Comput. , vol.83 , pp. 121-139
    • Immerman, N.1    Kozen, D.2
  • 12
    • 0002792630 scopus 로고
    • BG = PG: A success story
    • J. Fountain, ed., Kluwer, Dordrecht
    • J. E. Pin, BG = PG: a Success Story, in J. Fountain, ed., Semigroups, Formal Languages and Groups, pp. 33-48, Kluwer, Dordrecht, 1995.
    • (1995) Semigroups, Formal Languages and Groups , pp. 33-48
    • Pin, J.E.1
  • 13
    • 38249028201 scopus 로고
    • Locally trivial categories and unambiguous concatenation
    • J. E. Pin, H. Straubing, and D. Thérien, Locally Trivial Categories and Unambiguous Concatenation, J. Pure Appl. Algebra 52 (1988), 297-311.
    • (1988) J. Pure Appl. Algebra , vol.52 , pp. 297-311
    • Pin, J.E.1    Straubing, H.2    Thérien, D.3
  • 14
    • 0031536422 scopus 로고    scopus 로고
    • Polynomial closure and unambiguous product
    • J. E. Pin and P. Weil, Polynomial Closure and Unambiguous Product, Theory Comput. Systems 30 (1997), 383-422.
    • (1997) Theory Comput. Systems , vol.30 , pp. 383-422
    • Pin, J.E.1    Weil, P.2
  • 15
    • 38049000423 scopus 로고
    • The kernel of monoid morphisms
    • J. Rhodes and B. Tilson, The Kernel of Monoid Morphisms, J. Pure Appl. Algebra 62 (1989), 227-268.
    • (1989) J. Pure Appl. Algebra , vol.62 , pp. 227-268
    • Rhodes, J.1    Tilson, B.2
  • 16
    • 0001426212 scopus 로고
    • The pro-p topology of a free group and algorithmic problems in semigroups
    • L. Ribes and P. Zaleskii, The Pro-p Topology of a Free Group and Algorithmic Problems in Semigroups, Internat. J. Algebra Comput. 4 (1994), 359-374.
    • (1994) Internat. J. Algebra Comput. , vol.4 , pp. 359-374
    • Ribes, L.1    Zaleskii, P.2
  • 17
    • 38249025896 scopus 로고
    • Probablilistic complexity classes
    • U. Schöning, Probablilistic Complexity Classes, J. Comput. System Sci. 39 (1989), 84-100.
    • (1989) J. Comput. System Sci. , vol.39 , pp. 84-100
    • Schöning, U.1
  • 18
    • 0002948238 scopus 로고
    • Sur le produit de concatenation non-ambigu
    • M. P. Schützenberger, Sur le Produit de Concatenation Non-ambigu, Semigroup Forum 13 (1976), 47-76.
    • (1976) Semigroup Forum , vol.13 , pp. 47-76
    • Schützenberger, M.P.1
  • 19
    • 23044528291 scopus 로고    scopus 로고
    • Finite state automata: A geometric approach
    • B. Steinberg, Finite State Automata: a Geometric Approach, Trans. Amer. Math. Soc. 353 (2001), 3409-3464.
    • (2001) Trans. Amer. Math. Soc. , vol.353 , pp. 3409-3464
    • Steinberg, B.1
  • 20
    • 0000414442 scopus 로고
    • Extensions of the fundamental theorem of finite semigroups
    • P. Stiffler, Extensions of the Fundamental Theorem of Finite Semigroups, Adv. in Math. 11 (1973), 159-209.
    • (1973) Adv. in Math. , vol.11 , pp. 159-209
    • Stiffler, P.1
  • 21
    • 0000201603 scopus 로고
    • Families of recognizable sets corresponding to certain varieties of finite monoids
    • H. Straubing, Families of Recognizable Sets Corresponding to Certain Varieties of Finite Monoids, J. Pure Appl. Algebra 15 (1979), 305-318.
    • (1979) J. Pure Appl. Algebra , vol.15 , pp. 305-318
    • Straubing, H.1
  • 23
    • 0038246845 scopus 로고    scopus 로고
    • When can one finite monoid simulate another
    • J. C. Birget, S. Margolis, J. Meakin, and M. Sapir, eds., Birkhäuser, Boston, MA
    • H. Straubing, When Can One Finite Monoid Simulate Another, in J. C. Birget, S. Margolis, J. Meakin, and M. Sapir, eds., Algorithmic Problems in Groups and Semigroups, pp. 267-288, Birkhäuser, Boston, MA, 2000.
    • (2000) Algorithmic Problems in Groups and Semigroups , pp. 267-288
    • Straubing, H.1
  • 24
    • 0000544238 scopus 로고
    • Regular languages defined by generalized quantifiers
    • H. Straubing, D. Thérien, and W. Thomas, Regular Languages Defined by Generalized Quantifiers, Inform. and Comput. 118 (1995), 289-301.
    • (1995) Inform. and Comput. , vol.118 , pp. 289-301
    • Straubing, H.1    Thérien, D.2    Thomas, W.3
  • 25
    • 0001631788 scopus 로고
    • Classification of finite monoids: The language approach
    • D. Thérien, Classification of Finite Monoids: the Language Approach, Theoret. Comput. Sci. 14 (1981), 195-208.
    • (1981) Theoret. Comput. Sci. , vol.14 , pp. 195-208
    • Thérien, D.1
  • 27
    • 0020246633 scopus 로고
    • Classifying regular events in symbolic logic
    • W. Thomas, Classifying Regular Events in Symbolic Logic, J. Comput. System Sci. 25 (1982), 360-376.
    • (1982) J. Comput. System Sci. , vol.25 , pp. 360-376
    • Thomas, W.1
  • 28
    • 0002589619 scopus 로고
    • Categories as algebra
    • B. Tilson, Categories as Algebra, J. Pure Appl. Algebra 48 (1987), 83-198.
    • (1987) J. Pure Appl. Algebra , vol.48 , pp. 83-198
    • Tilson, B.1
  • 29
    • 0026239342 scopus 로고
    • PP is as hard as the polynomial-time hierarchy
    • S. Toda, PP Is as Hard as the Polynomial-Time Hierarchy, SIAM J. Comput. 20 (1991), 865-877.
    • (1991) SIAM J. Comput. , vol.20 , pp. 865-877
    • Toda, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.