메뉴 건너뛰기
Information Processing Letters
Volumn 84, Issue 6, 2002, Pages 291-294
The finite power problem revisited
Author keywords

Finite power problem; Finite power property; Formal languages; Recognizable languages
Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER PROGRAMMING LANGUAGES; THEOREM PROVING;
EID: 0037207010     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00319-8     Document Type: Article
Times cited : (4)
References (10)
  • 2
    • 0002951991 scopus 로고
    • A decision procedure for the order of regular events
    • Hashiguchi K. A decision procedure for the order of regular events. Theoret. Comput. Sci. 8:1979;69-72.
    • (1979) Theoret. Comput. Sci. , vol.8 , pp. 69-72
    • Hashiguchi, K.1
  • 3
    • 0000944539 scopus 로고
    • Limitedness theorem on finite automata with distance functions
    • Hashiguchi K. Limitedness theorem on finite automata with distance functions. J. Comput. System Sci. 24:1982;233-244.
    • (1982) J. Comput. System Sci. , vol.24 , pp. 233-244
    • Hashiguchi, K.1
  • 4
    • 0025418739 scopus 로고
    • Improved limitedness theorems on finite automata with distance functions
    • Hashiguchi K. Improved limitedness theorems on finite automata with distance functions. Theoret. Comput. Sci. 72:(1):1990;27-38.
    • (1990) Theoret. Comput. Sci. , vol.72 , Issue.1 , pp. 27-38
    • Hashiguchi, K.1
  • 5
    • 21344469033 scopus 로고    scopus 로고
    • New upper bounds to the limitedness of distance automata
    • F. Meyer auf der Heide, B. Monien(Eds.), ICALP'96 Proceedings Springer Berlin
    • Hashiguchi K. New upper bounds to the limitedness of distance automata. Meyer auf der Heide F., Monien B., ICALP'96 Proceedings. Lecture Notes in Computer Science. 1099:1996;324-335 Springer, Berlin.
    • (1996) Lecture Notes in Computer Science , vol.1099 , pp. 324-335
    • Hashiguchi, K.1
  • 6
    • 0035607401 scopus 로고    scopus 로고
    • Decidability equivalence between the star problem and the finite power problem in trace monoids
    • Kirsten D., Richomme G. Decidability equivalence between the star problem and the finite power problem in trace monoids. Theory Comput. Systems. 34:(3):2001;193-227.
    • (2001) Theory Comput. Systems , vol.34 , Issue.3 , pp. 193-227
    • Kirsten, D.1    Richomme, G.2
  • 7
    • 0002023544 scopus 로고
    • Finite power property for regular languages
    • M. Nivat (Ed.), North-Holland, Amsterdam
    • Linna M. Finite power property for regular languages. Nivat M., Automata, Languages and Programming. 1973;87-98 North-Holland, Amsterdam.
    • (1973) Automata, Languages and Programming , pp. 87-98
    • Linna, M.1
  • 8
    • 0348198473 scopus 로고    scopus 로고
    • Finite-state transducers in language and speech processing
    • Mohri M. Finite-state transducers in language and speech processing. Comput. Linguistics. 23:1997;269-311.
    • (1997) Comput. Linguistics , vol.23 , pp. 269-311
    • Mohri, M.1
  • 10
    • 0002700117 scopus 로고    scopus 로고
    • Regular languages
    • G. Rozenberg, A. Salomaa (Eds.), Word, Language, Grammar Springer, Berlin
    • Yu S. Regular Languages. Rozenberg G., Salomaa A., Word, Language, Grammar. Handbook of Formal Languages. 1:1997;41-110 Springer, Berlin.
    • (1997) Handbook of Formal Languages , vol.1 , pp. 41-110
    • Yu, S.1

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