Oscar H. Ibarra, Zhe Dang
Proceedings of the 10th International Conference on Developments in Language Theory
DLT, 2006.
@proceedings{DLT-2006, address = "Santa Barbara, California, USA", editor = "Oscar H. Ibarra and Zhe Dang", isbn = "3-540-35428-X", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the 10th International Conference on Developments in Language Theory}", volume = 4036, year = 2006, }
Contents (40 items)
- DLT-2006-AlurM #word
- Adding Nesting Structure to Words (RA, PM), pp. 1–13.
- DLT-2006-GurevichW #question #state machine
- Can Abstract State Machines Be Useful in Language Theory? (YG, CW), pp. 14–19.
- DLT-2006-Paun
- Languages in Membrane Computing: Some Details for Spiking Neural P Systems (GP), pp. 20–35.
- DLT-2006-EhrenfeuchtR
- Computational Nature of Biochemical Reactions (AE, GR), p. 36.
- DLT-2006-Kufleitner #logic
- Polynomials, Fragments of Temporal Logic and the Variety DA over Traces (MK), pp. 37–48.
- DLT-2006-DrosteR #automaton #infinity #logic #word
- Weighted Automata and Weighted Logics on Infinite Words (MD, GR), pp. 49–58.
- DLT-2006-FritzW #automaton #game studies #simulation
- Simulation Relations for Alternating Parity Automata and Parity Games (CF, TW), pp. 59–70.
- DLT-2006-BastienCFR #context-free grammar #equivalence
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (CB, JC, WF, WR), pp. 71–82.
- DLT-2006-MrazOP #on the
- On the Gap-Complexity of Simple RL-Automata (FM, FO, MP), pp. 83–94.
- DLT-2006-Schmitz #lalr #parsing
- Noncanonical LALR(1) Parsing (SS), pp. 95–107.
- DLT-2006-BertoniCP #context-free grammar #xml
- Context-Free Grammars and XML Languages (AB, CC, BP), pp. 108–119.
- DLT-2006-Caucal #automaton
- Synchronization of Pushdown Automata (DC), pp. 120–132.
- DLT-2006-KutribM #automaton #nondeterminism
- Context-Dependent Nondeterminism for Pushdown Automata (MK, AM), pp. 133–144.
- DLT-2006-HanSW #regular expression
- Prime Decompositions of Regular Languages (YSH, KS, DW), pp. 145–155.
- DLT-2006-SanteanY #ambiguity #finite #on the #transducer
- On Weakly Ambiguous Finite Transducers (NS, SY), pp. 156–167.
- DLT-2006-DassowV #finite #multi #string
- Ciliate Bio-operations on Finite String Multisets (JD, GV), pp. 168–179.
- DLT-2006-Domaratzki #using
- Characterizing DNA Bond Shapes Using Trajectories (MD), pp. 180–191.
- DLT-2006-JonoskaKM
- Involution Solid and Join Codes (NJ, LK, KM), pp. 192–202.
- DLT-2006-KountouriotisNR #boolean grammar #semantics
- Well-Founded Semantics for Boolean Grammars (VK, CN, PR), pp. 203–214.
- DLT-2006-Maletti #revisited
- Hierarchies of Tree Series Transformations Revisited (AM), pp. 215–225.
- DLT-2006-DrewesTEMW
- Bag Context Tree Grammars (FD, CdT, SE, BvdM, APJvdW), pp. 226–237.
- DLT-2006-ItoLS #bound
- Closure of Language Classes Under Bounded Duplication (MI, PL, KST), pp. 238–247.
- DLT-2006-Jurdzinski #context-sensitive grammar
- The Boolean Closure of Growing Context-Sensitive Languages (TJ), pp. 248–259.
- DLT-2006-DAlessandroRV #finite #order #set
- Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.
- DLT-2006-Carton
- The Growth Ratio of Synchronous Rational Relations Is Unique (OC), pp. 270–279.
- DLT-2006-Krieger #fixpoint #morphism #on the
- On Critical Exponents in Fixed Points of Non-erasing Morphisms (DK), pp. 280–291.
- DLT-2006-PaunP
- P Systems with Proteins on Membranes and Membrane Division (AP, BP), pp. 292–303.
- DLT-2006-CavaliereFH
- Computing by Only Observing (MC, PF, HJH), pp. 304–314.
- DLT-2006-BonizzoniM #reflexive
- A Decision Procedure for Reflexive Regular Splicing Languages (PB, GM), pp. 315–326.
- DLT-2006-DediuKKN #approach #generative #graph grammar
- Contextual Hypergraph Grammars — A New Approach to the Generation of Hypergraph Languages (AHD, RKH, HJK, BN), pp. 327–338.
- DLT-2006-Lakshmanan
- End-Marked Maximal Depth-First Contextual Grammars (LK), pp. 339–350.
- DLT-2006-MenzelPS #graph
- Some Examples of Semi-rational DAG Languages (JRM, LP, MS), pp. 351–362.
- DLT-2006-GruberH #bound #complexity #nondeterminism
- Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.
- DLT-2006-BellP #bound #matrix
- Lowering Undecidability Bounds for Decision Questions in Matrices (PB, IP), pp. 375–385.
- DLT-2006-Borel #3d #complexity #word
- Complexity of Degenerated Three Dimensional Billiard Words (JPB), pp. 386–396.
- DLT-2006-Shur #combinator #complexity
- Factorial Languages of Low Combinatorial Complexity (AMS), pp. 397–407.
- DLT-2006-GlasserTW #polynomial
- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy (CG, SDT, KWW), pp. 408–419.
- DLT-2006-OkhotinY #equation
- Language Equations with Complementation (AO, OY), pp. 420–432.
- DLT-2006-AnanichevVZ #automaton
- Synchronizing Automata with a Letter of Deficiency 2 (DSA, MVV, YIZ), pp. 433–442.
- DLT-2006-Ravikumar #automaton #finite #modelling #on the #probability
- On Some Variations of Two-Way Probabilistic Finite Automata Models (BR), pp. 443–454.
6 ×#automaton
4 ×#finite
4 ×#on the
3 ×#bound
3 ×#complexity
3 ×#word
2 ×#context-free grammar
2 ×#logic
2 ×#nondeterminism
4 ×#finite
4 ×#on the
3 ×#bound
3 ×#complexity
3 ×#word
2 ×#context-free grammar
2 ×#logic
2 ×#nondeterminism