Language and Automata Theory and Applications Third International Conference LATA 2009 Tarragona Spain April 2009 Proceedings 1st Edition by Carlos MartinVide, Friedrich Otto, Henning Fernau ISBN 9783540882817 by Frank J. Balbach, Thomas Zeugmann (auth.), Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martín-vide (eds.) 9783642009815, 3642009816 instant download after payment.

Language and Automata Theory and Applications Third International Conference LATA 2009 Tarragona Spain April 2009 Proceedings 1st Edition by Carlos MartinVide, Friedrich Otto, Henning Fernau - Ebook PDF Instant Download/Delivery: 9783540882817
Full download Language and Automata Theory and Applications Third International Conference LATA 2009 Tarragona Spain April 2009 Proceedings 1st Edition after payment

Product details:

ISBN 13: 9783540882817
Author: Carlos MartinVide, Friedrich Otto, Henning Fernau

This book constitutes the refereed proceedings of the Second International Conference on Language and Automata Theory and Applications, LATA 2008, held in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed and selected from 134 submissions. The papers deal with the various issues related to automata theory and formal languages

Language and Automata Theory and Applications Third International Conference LATA 2009 Tarragona Spain April 2009 Proceedings 1st Table of contents:

1. Tree-Walking Automata
2. Introduction
3. References
4. Formal Language Tools for Template-Guided DNA Recombination
5. References
6. Subsequence Counting, Matrix Representations and a Theorem of Eilenberg
7. Free Monoids, Algebras and Subsequences
8. Eilenberg’s Theorem
9. References
10. Synchronizing Automata and the v{C}ern'{y} Conjecture
11. History and Motivations
12. Algorithms and Complexity
13. The v{C}ern'{y} Conjecture
14. References
15. About Universal Hybrid Networks of Evolutionary Processors of Small Size
16. Introduction
17. Preliminaries
18. Main Results
19. Universality
20. Computational Completeness
21. Conclusions
22. References
23. On Bifix Systems and Generalizations
24. Introduction
25. Terminology
26. Bifix Rewriting Systems and Extensions
27. Tagged Infix Rewriting Systems
28. Extending TIRSs by Removing Tags
29. Extending TIRSs by Adding Tags
30. Remarks on Further Extensions
31. Comparison with Ground Tree Rewriting
32. Conclusion
33. References
34. Finite Automata, Palindromes, Powers, and Patterns
35. Introduction
36. Notions and Notation
37. Testing If an NFA Accepts at Least One Palindrome
38. Testing If an NFA Accepts at Least One Non-palindrome
39. Testing If an NFA Accepts a Word Matching a Pattern
40. Testing If an NFA Accepts a Non-$k$-Power
41. Automata Accepting Only Powers
42. FinalRemarks
43. References
44. One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
45. AxiomaticsofQCA
46. A Small Theory of Subsystems
47. Block Structure
48. Quantizations and Consequences
49. References
50. The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Re
51. Introduction
52. Definitions and Notation
53. Results
54. Parsimonious Reduction from SAT to 3-TRP
55. Parsimonious Reduction from SAT to 2-TRP
56. Unique and Infinite Variants of 3-TRP and 2-TRP
57. Conclusions
58. References
59. Optional and Iterated Types for Pregroup Grammars
60. Introduction
61. Background
62. Optional and Iterated Primitive Types
63. Conclusion
64. References
65. Transformations and Preservation of Self-assembly Dynamics through Homotheties
66. Introduction and Definitions
67. The Model of Self-assembly
68. Scaling While Preserving Dynamics
69. An Example
70. Formal Definitions
71. Zooming and Self-assembly
72. Zooming Sometimes Breaks Dynamics
73. The Order Condition
74. A Construction for the Order Case
75. Conclusion
76. References
77. Deterministic Input-Reversal and Input-Revolving Finite Automata
78. Introduction
79. Definitions and Preliminaries
80. Computational Capacity
81. Comparing Modes
82. Closure Properties
83. Conclusions
84. References
85. Random Context in Regulated Rewriting $Versus$ Cooperating Distributed Grammar Systems
86. Introduction
87. Definitions and Preliminaries
88. Simulation Results
89. Conclusions
90. References
91. Extending the Overlap Graph for Gene Assembly in Ciliates
92. Introduction
93. Background: Gene Assembly in Ciliates
94. Legal Strings with Markers
95. Simple and General String Pointer Rules
96. Extended Overlap Graph
97. Simple Graph Rules
98. Characterizing Successfulness
99. Discussion
100. References
101. Automatic Presentations for Cancellative Semigroups
102. Introduction
103. Automatic Presentations
104. Growth
105. The Characterization
106. References
107. Induced Subshifts and Cellular Automata
108. Introduction
109. Background
110. Induced Subshifts
111. Induced Cellular Automata
112. Conclusions
113. References
114. Hopcroft’s Algorithm and Cyclic Automata
115. Introduction
116. Minimization of Finite State Automata
117. Hopcroft’s Algorithm
118. Circular Words and Cyclic Automata
119. Hopcroft’s Algorithm on Cyclic Automata
120. Hopcroft’s Algorithm and Fibonacci Words
121. References
122. Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
123. Introduction
124. Standard Tree Automata for Ranked Trees
125. Stepwise Tree Automata for Binary Trees
126. Factorized Tree Automata
127. Automata for Unranked Trees and DTDs
128. References
129. Consensual Definition of Languages by Regular Sets
130. Introduction
131. First Definitions
132. First Properties
133. Consensual Languages Are in P
134. FurtherResults
135. Conclusion
136. References
137. $k$-Petri Net Controlled Grammars
138. Introduction
139. Preliminaries
140. Grammars
141. Petri Nets
142. cf Petri Nets
143. Petri Net Controlled Grammars
144. Hierarchy Results
145. Closure Properties
146. References
147. 2-Synchronizing Words
148. Introduction
149. Computational Complexity
150. Lower Bound
151. References
152. Not So Many Runs in Strings
153. Introduction
154. Definitions
155. Asymptotic Behavior of the Number of Runs
156. A Proof of Proposition 1 for Fixed Alphabets
157. On the Number of Microruns
158. Perspectives
159. References
160. A Hybrid Approach to Word Segmentation of Vietnamese Texts
161. Introduction
162. Lexicon Representation
163. Vietnamese Lexicon
164. Lexicon Representation
165. Vietnamese Word Segmentation
166. Segmentation Specification
167. Word Segmentation
168. Resolution of Ambiguities
169. Experiments
170. Corpus Constitution
171. Results
172. vnTokenizer
173. Conclusion
174. References
175. On Linear Logic Planning and Concurrency
176. Introduction
177. Linear Logic Planning and Concurrency
178. MELL in the Calculus of Structures
179. Linear Logic Planning
180. Independence and Causality in Plans
181. Partial Order Plans with a Concurrency Semantics
182. Planning and Concurrency
183. Labelled Event Structure Semantics of Planning Problems
184. Relation to Other Work
185. Discussion
186. References
187. On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range
188. Introduction
189. Tree Adjoining Grammars (TAG)
190. Range Concatenation Grammars (RCG)
191. From TAG to RCG
192. TT-MCTAG
193. From $k$-TT-MCTAG to RCG
194. Conclusion
195. References
196. Anti-pattern Matching Modulo
197. Introduction
198. Terms and Anti-patterns
199. Associative Matching
200. Matching Associative Patterns
201. Matching Associative Patterns with Unit Elements
202. Anti-pattern Matching Modulo
203. From Anti-pattern Matching to Equational Problems
204. A Specific Case: Matching $AU$ Anti-patterns
205. A More Efficient Algorithm for $AU$ Anti-patterns Matching
206. Anti-matching Modulo in Tom
207. Conclusion
208. References
209. Counting Ordered Patterns in Words Generated by Morphisms
210. Introduction
211. Preliminaries
212. Definitions and Notations
213. Ordered Patterns
214. Ordered Patterns with Gaps and Morphisms
215. Inversions, Non-inversions, and Repetitions with Gaps of $f^n$
216. Some Examples in the Binary Case
217. A Particular Family of Morphisms
218. Examples
219. The Thue-Morse Morphism
220. The Prouhet Morphisms
221. The Arshon Morphisms
222. Three Other Examples
223. Ordered Patterns with No Gaps and Morphisms
224. Rises, Descents, and Squares of $f^n$
225. Some Examples
226. References
227. Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
228. Introduction
229. Our Languages
230. Classical Universal Algebra
231. Literal Universal Algebra
232. Abelian Groups
233. Nilpotent Groups
234. Automata
235. References
236. Characterization of Star-Connected Languages Using Finite Automata
237. Preliminaries
238. Flat Languages and Trace Languages
239. Rational and Recognizable Languages
240. Connected Words, Traces and Languages
241. Star-Connected Expressions and Languages
242. Automata Accepting Star-Connected Languages
243. Concurrent Star Operation
244. References
245. Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
246. Introduction
247. Preliminaries
248. DP-Bounds
249. Forward Closures
250. Raise-DP-Bounds
251. Experiments
252. Conclusion
253. References
254. Further Results on Insertion-Deletion Systems with One-Sided Contexts
255. Introduction
256. Prerequisites
257. MainResults
258. Complexity Measures
259. Conclusions
260. References
261. On Regularity-Preservation by String-Rewriting Systems
262. Introduction
263. String-Rewriting Systems
264. Uniformly Length-Bounded Systems
265. Length-Bounded Relations
266. Outlook
267. References
268. Minimizing Deterministic Weighted Tree Automata
269. Introduction
270. Preliminaries
271. Myhill-Nerode Relation
272. Minimization Algorithm
273. ASmallExample
274. Conclusion and Open Problems
275. References
276. Lower Bounds for Generalized Quantum Finite Automata
277. Introduction
278. Technical Results
279. Applications
280. Discussion
281. References
282. How Many Figure Sets Are Codes?
283. Introduction
284. Definitions and Notations
285. Counting Square Figure Codes
286. Counting Word Codes
287. Counting Domino Figure Codes
288. Figures Defect
289. Codes in $cd_2$
290. Codes in $cd_3$
291. Codes in $cd_3$ with $|A|ge 3$
292. Conclusions
293. References
294. On Alternating Phrase-Structure Grammars
295. Introduction
296. Two Types of Alternating Grammars
297. Alternation Versus State-Alternation
298. ACSG s and Alternating Linear Bounded Automata
299. Concluding Remarks
300. References
301. A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata
302. Introduction
303. FRR-Automata
304. Strongly Lexicalized FRR-Automata
305. Two-Dimensional Hierarchies
306. Conclusion
307. References
308. Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard
309. Introduction
310. MGs with Unbounded Scrambling and Barriers
311. MG$^{scr}_{B0}$ is NP-Hard
312. Preliminaries: NP-Hardness
313. The Idea of the Proof
314. Proving NP-Hardness
315. Conclusions
316. References
317. Sorting and Element Distinctness on One-Way Turing Machines
318. Introduction
319. Previous Work
320. Sorting with One Work-Tape and One-Way Input
321. EDP with One Work-Tape and One-Way Input
322. Conclusion and Open Problems
323. References
324. On Periodicity of Generalized Two-Dimensional Words
325. Introduction
326. The Infinite Rectangular Grid
327. The Infinite Triangular and Hexagonal Grids
328. References
329. On the Analysis of “Simple” 2D Stochastic Cellular Automata
330. Introduction
331. Definitions
332. Experiments
333. Energy, Borders, Diamonds and Stable Configurations
334. Borders, Diamonds and Stripes
335. Energy
336. Stable Configurations
337. Analysis of the Convergence
338. Initial Energy Drop
339. The Last Steps of Convergence
340. References
341. Polycyclic and Bicyclic Valence Automata
342. Introduction
343. Preliminaries
344. Automata, Transductions and Closure Properties
345. Polycyclic Monoids
346. References
347. Length Codes, Products of Languages and Primality
348. Introduction
349. Different Types of Prime Factorizations
350. Comparisons between Different Notions
351. Length Codes
352. Techniques for Star Languages
353. On Regular Prime Decompositions of $K^*$ and Related Languages
354. Conclusion
355. References
356. An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
357. Introduction
358. Preliminaries
359. Strongly Forward-Deterministic Pushdown Automata
360. Inclusion Problem
361. Checking the Compatibility of the Shape
362. Comparison Forest
363. Time Complexity
364. Concluding Remarks
365. References

People also search for Language and Automata Theory and Applications Third International Conference LATA 2009 Tarragona Spain April 2009 Proceedings 1st:

Tags: Carlos MartinVide, Friedrich Otto, Henning Fernau, Language, Automata