|
|
|
|
| LEADER |
03180nam a22003855i 4500 |
| 001 |
000281299 |
| 005 |
20210722121600.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170602s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319602523
|
| 024 |
7 |
|
|a 10.1007/978-3-319-60252-3
|2 doi
|
| 040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
| 245 |
1 |
0 |
|a Descriptional Complexity of Formal Systems :
|b 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings /
|c edited by Giovanni Pighizzini, Cezar Câmpeanu.
|
| 250 |
|
|
|a 1st ed. 2017.
|
| 260 |
# |
# |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a X, 311 p. 76 illus. :
|b online resource.
|
| 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 Theoretical Computer Science and General Issues ;
|v 10316
|
| 505 |
0 |
|
|a Sensing as a Complexity Measure -- Avoiding Overlaps in Pictures -- Descriptional Complexity and Operations - Two non-Classical Cases -- Applications of Transducers in Independent Languages, Word Distances, Codes -- On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages -- On the Average Complexity of Strong Star Normal Form -- Most Complex Non-Returning Regular Languages -- Uncountable realtime probabilistic classes -- A Parametrized Analysis of Algorithms on Hierarchical Graphs -- Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity -- Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors -- Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete -- Self-attraction removal from oritatami systems -- One-Time Nondeterministic Computations -- Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages -- Branching Measures and Nearly Acyclic NFAs -- Square on Deterministic, Alternating, and Boolean Finite Automata -- A Pumping Lemma for Ordered Restarting Automata -- Concise Representations of Reversible Automata -- State Complexity of Unary SV-XNFA with Different Acceptance Conditions -- Reset Complexity of Ideal Languages Over a Binary Alphabet -- 2-state 2-symbol Turing machines with periodic support produce regular sets -- State Complexity of Suffix Distance -- The quotient operation on input-driven pushdown automata.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
1 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
| 700 |
1 |
|
|a Pighizzini, Giovanni.
|e editor.
|0 (orcid)0000-0002-7509-7842
|1 https://orcid.org/0000-0002-7509-7842
|
| 700 |
1 |
|
|a Câmpeanu, Cezar.
|e editor.
|0 (orcid)0000-0002-9777-3012
|1 https://orcid.org/0000-0002-9777-3012
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|