Descriptional complexity of formal systems : 14th international workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, proceedings / Martin Kutrib, Nelma Moreira, Rogério Reis (eds.).
Annotation
Saved in:
| Main Authors: | , , |
|---|---|
| Corporate Author: | |
| Format: | Ebook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
[2012]
|
| Series: | Lecture notes in computer science ;
7386. LNCS sublibrary. Theoretical computer science and general issues |
| Subjects: | |
| Online Access: | Springer eBooks |
MARC
| LEADER | 00000czm a2200000 i 4500 | ||
|---|---|---|---|
| 003 | OCoLC | ||
| 005 | 20240619104413.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---|nuuu | ||
| 008 | 120719s2012 gw a ob 101 0 eng d | ||
| 010 | |a 2012941230 | ||
| 011 | |a Direct Search Result | ||
| 011 | |a EDS Title: Descriptional Complexity of Formal Systems | ||
| 011 | |a MARC Score : 11000(25800) : OK | ||
| 020 | |z 3642316220 | ||
| 020 | |z 9783642316227 | ||
| 035 | |a (ATU)b24346512 | ||
| 035 | |a (EDS)EDS1382719 | ||
| 035 | |a (OCoLC)800729342 | ||
| 040 | |a GW5XE |b eng |e rda |c GW5XE |d C$Q |d COO |d ZMC |d OCLCQ |d E7B |d NAM |d REB |d OCLCF |d BEDGE |d OCLCO |d YDXCP |d AU@ |d VT2 |d OCL |d EBLCP |d ESU |d IOG |d ATU | ||
| 050 | 4 | |a QA267.3 |b .D34 2012 | |
| 082 | 0 | 4 | |a 005.131 |2 23 |
| 111 | 2 | |a DCFS (Workshop) |n (14th : |d 2012 : |c Braga, Portugal) |9 496120 | |
| 245 | 1 | 0 | |a Descriptional complexity of formal systems : |b 14th international workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, proceedings / |c Martin Kutrib, Nelma Moreira, Rogério Reis (eds.). |
| 246 | 3 | 0 | |a DCFS 2012 |
| 264 | 1 | |a Berlin ; |a New York : |b Springer, |c [2012] | |
| 264 | 4 | |c ©2012 | |
| 300 | |a 1 online resource (x, 318 pages) : |b illustrations. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science, |x 1611-3349 ; |v 7386 | |
| 490 | 1 | |a LNCS sublibrary. SL 1, Theoretical computer science and general issues | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | 0 | |t Computing with Capsules / |r Jean-Baptiste Jeannin and Dexter Kozen -- |t Minicomplexity / |r Christos A. Kapoutsis -- |t Logical Analysis of Hybrid Systems: A Complete Answer to a Complexity Challenge / |r André Platzer -- |t Groups and Automata: A Perfect Match / |r Pedro V. Silva -- |t Uniform Distributed Pushdown Automata Systems / |r Fernando Arroyo, Juan Castellanos and Victor Mitrana -- |t Removing Nondeterminism in Constant Height Pushdown Automata / |r Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti and Beatrice Palano -- |t On Inverse Operations and Their Descriptional Complexity / |r Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi and Giovanni Pighizzini -- |t Deciding Representability of Sets of Words of Equal Length / |r Francine Blanchet-Sadri and Sean Simmons -- |t Syntactic Complexities of Some Classes of Star-Free Languages / |r Janusz Brzozowski and Baiyu Li -- |t Randomness Behaviour in Blum Universal Static Complexity Spaces / |r Cezar Câmpeanu -- |t Production Complexity of Some Operations on Context-Free Languages / |r Jürgen Dassow and Ronny Harbich -- |t State Complexity of Star and Square of Union of k Regular Languages / |r Yuan Gao and Lila Kari -- |t State Complexity of Chop Operations on Unary and Finite Languages / |r Markus Holzer and Sebastian Jakobi -- |t On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars / |r Artur Jeż and Alexander Okhotin -- |t Descriptional Complexity of Biautomata / |r Galina Jirásková and Ondřej Klíma -- |t Descriptional Complexity of Pushdown Store Languages / |r Andreas Malcher, Katja Meckel, Carlo Mereghetti and Beatrice Palano -- |t On Internal Contextual Grammars with Subregular Selection Languages / |r Florin Manea and Bianca Truthe -- |t An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets / |r Alexander Meduna, Lukáš Vrábel and Petr Zemek -- |t Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata / |r Friedrich Otto -- |t State Complexity and Limited Nondeterminism / |r Alexandros Palioudakis, Kai Salomaa and Selim G. Akl -- |t Bounded Counter Languages / |r Holger Petersen -- |t State Complexity of Projection and Quotient on Unranked Trees / |r Xiaoxue Piao and Kai Salomaa -- |t Iterating Invertible Binary Transducers / |r Klaus Sutner and Kevin Lewi -- |t Minimal DFA for Symmetric Difference NFA / |r Brink van der Merwe, Hellis Tamm and Lynette van Zijl. |
| 520 | 8 | |a Annotation |b This book constitutes the refereed proceedings of the 14th International Workshop of Descriptional Complexity of Formal Systems 2012, held in Braga, Portugal, in July 2012. The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) objects; state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov complexity. | |
| 588 | |a Machine converted from AACR2 source record. | ||
| 588 | 0 | |a Online resource; title from PDF title page (SpringerLink, viewed Aug. 10, 2012). | |
| 650 | 0 | |a Computational complexity |v Congresses |9 714600 | |
| 650 | 0 | |a Formal languages |v Congresses |9 676222 | |
| 650 | 0 | |a Formal methods (Computer science) |v Congresses |9 557605 | |
| 650 | 0 | |a Machine theory |v Congresses |9 676214 | |
| 700 | 1 | |a Kutrib, Martin, |e author. |9 299787 | |
| 700 | 1 | |a Moreira, Nelma, |e author. |9 299908 | |
| 700 | 1 | |a Reis, Rogério, |e author. |9 1116345 | |
| 776 | 0 | 8 | |i Printed edition: |z 9783642316227 |
| 776 | 1 | 8 | |w (OCoLC)848010285 |w (OCoLC)964878595 |w (OCoLC)985039298 |w (OCoLC)1005821976 |
| 830 | 0 | |a Lecture notes in computer science ; |v 7386. |x 1611-3349. |9 291610 | |
| 830 | 0 | |a LNCS sublibrary. |n SL 1, |p Theoretical computer science and general issues |9 291648 | |
| 856 | 4 | 0 | |u https://ezproxy.aut.ac.nz/login?url=https://link.springer.com/10.1007/978-3-642-31623-4 |z Springer eBooks |x TEMPORARY ERM URL |
| 907 | |a .b24346512 |b 06-09-21 |c 15-11-17 | ||
| 942 | |c EB | ||
| 998 | |a none |b 16-11-17 |c m |d z |e - |f eng |g gw |h 0 | ||
| 999 | |c 1433932 |d 1433932 | ||