主畫面 | 輔助說明 | 重新查詢 | English Mode

中研院圖書館首頁


重新查詢 轉出資料 MARC 顯示 其他查詢
   
Record:   Prev Next
作者 DCFS (Workshop) (17th : 2015 : Waterloo, Ont.)
書名 Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings / edited by Jeffrey Shallit, Alexander Okhotin
出版項 Cham : Springer International Publishing : Imprint: Springer, 2015
國際標準書號 9783319192253 (electronic bk.)
9783319192246 (paper)
國際標準號碼 10.1007/978-3-319-19225-3 doi
 book jacket
請按以下連結
eBook(Springerlink)
說明 1 online resource (xii, 293 pages) : illustrations, digital ; 24 cm
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
系列 Lecture notes in computer science, 0302-9743 ; 9118
Lecture notes in computer science ; 9118
附註 Invited Talks -- Regular Functions -- Unambiguity in Automata Theory -- Contributed Papers -- Partial Derivative Automaton for Regular Expressions with Shue -- Upper Bound on Syntactic Complexity of Suffix-Free Languages -- Nondeterministic Tree Width of Regular Languages -- Integer Complexity: Experimental and Analytical Results II -- Square on ideal, closed and free languages -- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2] -- Compressibility of finite languages by grammars -- On the Complexity and Decidability of Some Problems Involving Shue -- On the Computational Complexity of Problems Related to Distinguishability Sets -- Prefix-Free Subsets of Regular Languages and Descriptional Complexity -- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems -- On Simulation Costs of Unary Limited Automata -- On some decision problems for stateless deterministic ordered restarting Automata -- Quantum queries on permutations -- Complement on Free and Ideal Languages -- Universal Disjunctive Concatenation and Star -- Quasi-Distances and Weighted Finite Automata -- The State Complexity of Permutations on Finite Languages Over Binary Alphabets -- Star-Complement-Star on Prefix-Free Languages -- Groups whose word problem is a Petri net language -- Regular realizability problems and context-free languages -- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton -- Quantum State Complexity of Formal Languages
Host Item Springer eBooks
主題 Formal methods (Computer science) -- Congresses
Formal languages -- Congresses
Computer Science
Computation by Abstract Devices
Mathematical Logic and Formal Languages
Logics and Meanings of Programs
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Alt Author Shallit, Jeffrey., editor
Okhotin, Alexander., editor
SpringerLink (Online service)
Alt Title DCFS 2015
Record:   Prev Next
重新查詢 轉出資料 MARC 顯示 其他查詢


主畫面 | 輔助說明 | English Mode