You have Guest access.
Log In
Adrian Horia Dediu, Armand Mihai Ionescu and Carlos Martín-Vide
Front matter
1-18
Recent Developments in Algorithmic Teaching
19-22
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
23-42
Descriptional and Computational Complexity of Finite Automata
43-58
Hypothesis Spaces for Learning
59-70
State Complexity of Nested Word Automata
71-82
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
83-92
Minimal Union-Free Decompositions of Regular Languages
93-104
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
105-116
Matching Trace Patterns with Regular Policies
117-128
Absolute Convergence of Rational Series Is Semi-decidable
129-140
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
141-151
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
152-163
Refinement and Consistency of Timed Modal Specifications
164-175
Nondeterministic Instance Complexity and Proof Systems with Advice
176-187
How Many Holes Can an Unbordered Partial Word Contain?
188-199
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
200-211
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
212-223
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
224-235
Picture Languages Generated by Assembling Tiles
236-246
Undecidability of Operation Problems for T0L Languages and Subclasses
247-258
Decision Problems for Convex Languages
259-266
On a Family of Morphic Images of Arnoux-Rauzy Words
267-278
Monadic Datalog Tree Transducers
279-289
On Extended Regular Expressions
290-301
Multi-tilde Operators and Their Glushkov Automata
302-313
Non-uniform Cellular Automata
314-325
A Cryptosystem Based on the Composition of Reversible Cellular Automata
326-337
Grammars Controlled by Special Petri Nets
338-349
Nested Counters in Bit-Parallel String Matching
350-361
Bounded Delay and Concurrency for Earliest Query Answering
362-373
Learning by Erasing in Dynamic Epistemic Logic
374-385
The Fault Tolerance of NP-Hard Problems
386-397
Termination of Priority Rewriting
398-409
State Complexity of Combined Operations for Prefix-Free Regular Languages
410-421
Towards a Taxonomy for ECFG and RRPG Parsing
422-433
Counting Parameterized Border Arrays for a Binary Alphabet
434-445
Bounded Hairpin Completion
446-457
Rigid Tree Automata
458-468
Converting Self-verifying Automata into Deterministic Automata
469-480
Two Equivalent Regularizations for Tree Adjoining Grammars
481-492
Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching
493-504
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
505-517
Automata on Gauss Words
518-529
Analysing Complexity in Classes of Unary Automatic Structures
530-541
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
542-553
Segmentation Charts for Czech – Relations among Segments in Complex Sentences
554-565
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
566-577
Efficiency of the Symmetry Bias in Grammar Acquisition
578-587
A Series of Run-Rich Strings
588-600
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
601-613
The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
614-625
Prediction of Creole Emergence in Spatial Language Dynamics
626-637
On the Average Size of Glushkov’s Automata
638-647
Tiling the Plane with a Fixed Number of Polyominoes
648-659
New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality
660-671
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
672-683
Finitely Generated Synchronizing Automata
684-695
Genetic Algorithm for Synchronization
696-701
Constructing Infinite Words of Intermediate Arithmetical Complexity
702-714
From Gene Trees to Species Trees through a Supertree Approach
715-727
A Kleene Theorem for Forest Languages
728-739
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
740-751
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info