Home | Help | New Search | 中文模式

AS Library Service 


Start Over Export MARC Display Return To Browse Another Search
   
Record 1 of 2
Record:   Prev Next
Author DCFS (Workshop) (17th : 2015 : Waterloo, Ont.)
Title Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings / edited by Jeffrey Shallit, Alexander Okhotin
Imprint Cham : Springer International Publishing : Imprint: Springer, 2015
 book jacket
Click on the following to:
eBook(Springerlink)
Descript 1 online resource (xii, 293 pages) : illustrations, digital ; 24 cm
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Series Lecture notes in computer science, 0302-9743 ; 9118
Lecture notes in computer science ; 9118
Note 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
Subject 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 1 of 2
Record:   Prev Next
Start Over Export MARC Display Return To Browse Another Search


Home | Help | 中文模式