Proceedings of the 15th International Conference on Developments in Language Theory
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Giancarlo Mauri, Alberto Leporati
Proceedings of the 15th International Conference on Developments in Language Theory
DLT, 2011.

Full names Links ISxN
	address       = "Milan, Italy",
	doi           = "10.1007/978-3-642-22321-1",
	editor        = "Giancarlo Mauri and Alberto Leporati",
	isbn          = "978-3-642-22320-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 15th International Conference on Developments in Language Theory}",
	volume        = 6795,
	year          = 2011,

Contents (46 items)

DLT-2011-BadkobehCC #string
Hunting Redundancies in Strings (GB, SC, MC), pp. 1–14.
DLT-2011-RestivoV #automaton
Some Remarks on Automata Minimality (AR, RV), pp. 15–27.
Growth Properties of Power-Free Languages (AMS), pp. 28–43.
DLT-2011-Wilke #functional #regular expression
A Functional Program for Regular Expressions Matching — Abstract of Invited Talk (TW), pp. 44–45.
DLT-2011-YuG #approximate #complexity #research
State Complexity Research and Approximation (SY, YG), pp. 46–57.
DLT-2011-BattagliaGS #multi #order
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees (GB, RG, NS), pp. 58–69.
DLT-2011-Blanchet-SadriS #word
Avoiding Abelian Powers in Partial Words (FBS, SS), pp. 70–81.
DLT-2011-BonizzoniJ #constant
Regular Splicing Languages Must Have a Constant (PB, NJ), pp. 82–92.
DLT-2011-BrodaMMR #automaton #complexity
The Average Transition Complexity of Glushkov and Partial Derivative Automata (SB, AM, NM, RR), pp. 93–104.
Theory of Átomata (JAB, HT), pp. 105–116.
DLT-2011-BrzozowskiY #complexity
Syntactic Complexity of Ideal and Closed Languages (JAB, YY), pp. 117–128.
Generalized One-Unambiguity (PC, YSH, LM), pp. 129–140.
DLT-2011-CeceG #2d #automaton #online #simulation
Simulations over Two-Dimensional On-Line Tessellation Automata (GC, AG), pp. 141–152.
DLT-2011-CernoM #automaton
Δ-Clearing Restarting Automata and CFL (PC, FM), pp. 153–164.
DLT-2011-CharlierRS #automation #decidability #sequence
Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 165–179.
DLT-2011-ChaturvediOT #game studies #infinity
Languages vs. ω-Languages in Regular Infinite Games (NC, JO, WT), pp. 180–191.
DLT-2011-DiekertM #infinity #problem #word
Solving Word Problems in Group Extensions over Infinite Words (VD, AGM), pp. 192–203.
DLT-2011-DomaratzkiR #word
Abelian Primitive Words (MD, NR), pp. 204–215.
DLT-2011-Esik #linear #order
Scattered Context-Free Linear Orderings (), pp. 216–227.
DLT-2011-FiciL #on the #word
On Prefix Normal Words (GF, ZL), pp. 228–238.
DLT-2011-GusevP #on the #set
On Non-complete Sets and Restivo’s Conjecture (VVG, EVP), pp. 239–250.
DLT-2011-MenibusS #approach #automaton #self
Self-organization in Cellular Automata: A Particle-Based Approach (BHdM, MS), pp. 251–263.
DLT-2011-HolzerJ #complexity
Chop Operations and Expressions: Descriptional Complexity Considerations (MH, SJ), pp. 264–275.
Nodes Connected by Path Languages (MH, MK, UL), pp. 276–287.
DLT-2011-HundeshagenO #automaton #regular expression
Characterizing the Regular Languages by Nonforgetting Restarting Automata (NH, FO), pp. 288–299.
DLT-2011-IbarraY #on the #transducer
On Two-Way Transducers (OHI, HCY), pp. 300–311.
DLT-2011-KortelainenS #bound #context-free grammar
There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages (JK, TS), pp. 312–323.
DLT-2011-KuncO #automaton #finite #using
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (MK, AO), pp. 324–336.
DLT-2011-Manea #network
Deciding Networks of Evolutionary Processors (FM), pp. 337–349.
DLT-2011-MantaciM #linear
From Linear Partitions to Parallelogram Polyominoes (RM, PM), pp. 350–361.
DLT-2011-PlyushchenkoS #on the
On Brzozowski’s Conjecture for the Free Burnside Semigroup Satisfying x2 = x3 (ANP, AMS), pp. 362–373.
DLT-2011-RodaroS #automaton #problem
Never Minimal Automata and the Rainbow Bipartite Subgraph Problem (ER, PVS), pp. 374–385.
DLT-2011-SelivanovK #algebra #regular expression
Boolean Algebras of Regular Languages (VLS, AK), pp. 386–396.
DLT-2011-Shallit #revisited #theorem
Fife’s Theorem Revisited (JS), pp. 397–405.
DLT-2011-PelantovaS #infinity #word
Infinite Words Rich and Almost Rich in Generalized Palindromes (EP, SS), pp. 406–416.
DLT-2011-TasdemirS #automaton #modelling
Models of Pushdown Automata with Reset (NT, ACCS), pp. 417–428.
DLT-2011-Yoshinaka #concept #context-free grammar #learning #towards
Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices (RY), pp. 429–440.
DLT-2011-RampersadV #on the #word
On Highly Repetitive and Power Free Words (NR, EV), pp. 441–451.
A Sufficient Condition for Erasing Productions to Be Avoidable (GZ), pp. 452–463.
DLT-2011-BattaglinoFFR #encoding #regular expression
Encoding Centered Polyominoes by Means of a Regular Language (DB, JMF, AF, SR), pp. 464–465.
DLT-2011-ChandesrisDFM #aspect-oriented #automaton
Computational Aspects of Asynchronous Cellular Automata (JC, AD, EF, LM), pp. 466–468.
DLT-2011-CherubiniFP #word
Short 3-Collapsing Words over a 2-Letter Alphabet (AC, AF, BP), pp. 469–471.
DLT-2011-DrosteMST #composition #finite
A Cascade Decomposition of Weighted Finite Transition Systems (MD, IM, BS, AT), pp. 472–473.
Morphic Characterizations in Terms of Insertion Systems with a Context of Length One (KF), pp. 474–475.
DLT-2011-Kasprzik #automaton #finite #query
Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.
DLT-2011-KitaevSSU #graph #on the
On the Representability of Line Graphs (SK, PS, CS, ), pp. 478–479.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.