Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings /: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings. (2015)
- Record Type:
- Book
- Title:
- Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings /: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings. (2015)
- Main Title:
- Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings
- Other Titles:
- DCFS 2015
- Further Information:
- Note: Jeffrey Shallit, Alexander Okhotin (eds.).
- Editors:
- Shallit, Jeffrey Outlaw
Okhotin, Alexander - Other Names:
- DCFS (Workshop), 17th
- Contents:
- 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 StateInvited 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. … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2015
- Extent:
- 1 online resource (xii, 293 pages), illustrations
- Subjects:
- 004.01/51
Computer science
Formal methods (Computer science) -- Congresses
Formal languages -- Congresses
Formal languages
Formal methods (Computer science)
Computer Science
Engineering & Applied Sciences
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
Mathematics -- Logic
Computers -- Programming -- General
Computers -- Programming -- Algorithms
Computers -- Data Processing
Mathematical theory of computation
Computer programming / software development
Algorithms & data structures
Discrete mathematics
Logic design
Computer software
Computational complexity
Computers -- Machine Theory
User interface design & usability
Electronic books
Conference papers and proceedings
Electronic books - Languages:
- English
- ISBNs:
- 9783319192253
3319192256
3319192248
9783319192246 - Related ISBNs:
- 9783319192246
- Notes:
- Note: Includes bibliographical references and author index.
Note: Online resource; title from PDF title page (SpringerLink, viewed June 25, 2015). - Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.369895
- Ingest File:
- 01_353.xml