Finite state languages
作者： Noam Chomsky , George A. Miller
DOI: 10.1016/S0019-9958(58)90082-2
关键词: State transition table 、 Generalized nondeterministic finite automaton 、 Deterministic finite automaton 、 Mathematics 、 Discrete mathematics 、 Quantum finite automata 、 Nondeterministic finite automaton 、 Finite set 、 State diagram 、 Infinite set
摘要: A finite state language is a or infinite set of strings (sentences) symbols (words) generated by rules (the grammar), where each rule specifies the system in which it can be applied, symbol generated, and after applied. number equivalent descriptions languages are explored. simple structural characterization theorem for established, based on cyclical structure grammar. It shown that complement any formed given vocabulary also language, union two language; i.e., all Boolean algebra. Procedures calculating grammatical length described.
elsevier.com
sci-hub.se 参考文章(3)
CE Shennon, Warren Weaver, A mathematical theory of communication Bell System Technical Journal. ,vol. 27, pp. 379- 423 ,(1948) , 10.1002/J.1538-7305.1948.TB01338.X
N. Chomsky, Three models for the description of language IEEE Transactions on Information Theory. ,vol. 2, pp. 113- 124 ,(1956) , 10.1109/TIT.1956.1056813
M. Schutzenberger, On an application of semi groups methods to some problems in coding IRE Transactions on Information Theory. ,vol. 2, pp. 47- 60 ,(1956) , 10.1109/TIT.1956.1056809