Titlebook: Developments in Language Theory; 14th International C Yuan Gao,Hanlin Lu,Sheng Yu Conference proceedings 2010 Springer-Verlag Berlin Heidel

搭話

書目名稱Developments in Language Theory影響因子(影響力)




書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名




書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度




書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Developments in Language Theory被引頻次




書目名稱Developments in Language Theory被引頻次學(xué)科排名




書目名稱Developments in Language Theory年度引用




書目名稱Developments in Language Theory年度引用學(xué)科排名




書目名稱Developments in Language Theory讀者反饋




書目名稱Developments in Language Theory讀者反饋學(xué)科排名

使閉塞

Undecidability and Hierarchy Results for Parallel Communicating Finite Automataany type of PCFAs under consideration. Moreover, it is proven that the number of automata in the system induces infinite hierarchies for deterministic and nondeterministic PCFAs in three working modes.

剝削

乞討

The Complexity of Regular(-Like) Expressions expressions such as, e.g., membership, inequivalence, and non-emptiness of complement, and finally on the operation problem measuring the required size for transforming expressions with additional language operations (built-in or not) into equivalent ordinary regular expressions.

Harpoon

DNA Computing and Its Implications for Theoretical Computer Science theoretical computer science. We namely describe how properties of DNA-based information, and in particular the Watson-Crick complementarity of DNA single strands, have influenced areas of theoretical computer science such as formal language theory, coding theory, automata theory and combinatorics on words.

上漲

Numeration Systems: A Link between Number Theory and Formal Language Theoryets of integers and automatic sequences. We briefly sketch some results about transcendence related to the representation of real numbers. We conclude with some applications to combinatorial game theory and verification of infinite-state systems and present a list of open problems.

上漲

Algorithmic Properties of Millstream Systemsdules and MSO logic as interface logic. We focus on the so-called completion problem: Given trees generated by a subset of the modules, can they be completed into a valid configuration of the Millstream system?

檢查

Extricate

Genteel

Humanistic Psychology and Metapsychology, all subclasses corresponding to different notion of unambiguity and determinism define a hierarchy inside REC. Moreover we show that some definitions of unambiguity are equivalent to corresponding notions of determinism and therefore correspond decidable classes closed under complementation and linear parsing algorithms.