1 option
Developments in Language Theory : 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings / edited by Tero Harju, Juhani Karhumäki, Arto Lepistö.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4588.
- Theoretical Computer Science and General Issues ; 4588
- Language:
- English
- Subjects (All):
- Logic, Symbolic and mathematical.
- Computers.
- Computer logic.
- Computer science--Mathematics.
- Computer science.
- Mathematical Logic and Formal Languages.
- Computation by Abstract Devices.
- Logics and Meanings of Programs.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Mathematical Logic and Formal Languages.
- Computation by Abstract Devices.
- Logics and Meanings of Programs.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Physical Description:
- 1 online resource (XI, 428 pages).
- Edition:
- First edition 2007.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
- System Details:
- text file PDF
- Contents:
- Invited Talks
- On First-Order Fragments for Words and Mazurkiewicz Traces
- Quantitative Generalizations of Languages
- What Do We Know About Language Equations?
- Information Distance and Applications
- Finite Automata and the Writing of Numbers
- Descriptional Complexity of Nondeterministic Finite Automata
- Contributed Papers
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Coding Partitions: Regularity, Maximality and Global Ambiguity
- Multi-letter Reversible and Quantum Finite Automata
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids
- The Dynamics of Cellular Automata in Shift-Invariant Topologies
- Two Element Unavoidable Sets of Partial Words
- Hairpin Finite Automata
- Characterizing Reduction Graphs for Gene Assembly in Ciliates
- 2-Visibly Pushdown Automata
- An Efficient Computation of the Equation -Automaton of a Regular -Expression
- An Extension of Newton's Method to ?-Continuous Semirings
- Non-constructive Methods for Finite Probabilistic Automata
- The Unambiguity of Segmented Morphisms
- Commutation of Binary Factorial Languages
- Inapproximability of Nondeterministic State and Transition Complexity Assuming P???NP
- State Complexity of Union and Intersection of Finite Languages
- Bisimulation Minimisation for Weighted Tree Automata
- Conjunctive Grammars Can Generate Non-regular Unary Languages
- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet
- Reduced Languages as ?-Generators
- Avoiding Approximate Squares
- Duplication Roots
- Complexity Theory for Splicing Systems
- Descriptional Complexity of Bounded Context-Free Languages
- Definable Transductions and Weighted Logics for Texts
- A Star Operation for Star-Free Trace Languages
- Finite Automata on Unranked and Unordered DAGs
- On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
- A Local Balance Property of Episturmian Words
- Suffix Automata and Standard Sturmian Words
- Fine Hierarchy of Regular Aperiodic ?-Languages
- On Transition Minimality of Bideterministic Automata.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-73208-2
- 9783540732082
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.