Book, R. V., Formal language theory and theoretical computer science. In: Automata Theory and Formal Languages , Proc. 2 nd GI Conf., Lecture Notes in Computer Science 33, Springer Verlag, Berlin 1975, pp. 1–15.Book, R.V. (1975). Formal Language Theory and Theoretical Computer Science...
Some Notes on the Formal Properties of Bidirectional Optimality Theory. Journal of Logic, Language and Information 11, 427–451 (2002). https://doi.org/10.1023/A:1019969702169 Download citation Issue DateSeptember 2002 DOIhttps://doi.org/10.1023/A:1019969702169 finite state transducers formal ...
Publisher finelybook 出版社: De Gruyter (January 31, 2022) Language 语言: English Print Length 页数: 232 pages ISBN-10: 3110752271 ISBN-13: 9783110752274 Book Description The book is a concise, self-contained and fully updated introduction to automata theory – a fundamental topic of computer...
The Formal Language Theory Column by Arto Salomaa 来自 Semantic Scholar 喜欢 0 阅读量: 5 作者: A Okhotin 摘要: Conjunctive grammars were introduced in 2000 as a generaliz ation of context-free grammars that allows the use of an explicit intersection ope ration in rules. Several theoretical...
[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 372 || A new approach to formal language theory by kolmogorov complexity We explain the foundations of a new class of formal languages for the construction of large Feynman diagrams which contribute to solutions of all ...
Natural Language and Linguistic Theory 7 481–549. Bird, Steven and T. Mark Ellison 1994. One-level phonology: autoseg- mental representations and rules as finite automata. Computational Linguistics 20 1 . Bird, Steven and Ewan Klein 1989. Phonological Events, University of Edinburgh Centre for ...
proper to the theory of computation, this construal has yielded mathematical insights that occasionally permit speculation about the acquisition of competence to be cast in sharper terms than heretofore. This cluster of related mathematical results has come to be known as(formal) learning theory.1 ...
6 as “fall-through” execution, which is notationally more convenient than our goto language (Sect. 4.1). Our Isabelle/HOL encoding uses the goto model (and hence is consistent with the language in Sect. 4.1). In order to handle the weak behaviours introduced by , we introduce several ...
Formal language theory is, together with automata theory, which is really inseparable from language theory, the oldest branch of theoretical computer scien... A Salomaa - 《Information Sciences》 被引量: 156发表: 1991年 Langford strings, formal languages and contextual ambiguity We propose a series...
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a... PMB Vit'Anyi,M Li 被引量: 0发表: 2000年 [Lecture Notes in Computer Science] Automata, Languages and Programming Volume 372 || A...