Scientific Applications of Language Methods

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $128.26
Usually ships in 1-2 business days
(Save 12%)
Other sellers (Hardcover)
  • All (6) from $128.26   
  • New (5) from $128.26   
  • Used (1) from $144.34   

More About This Textbook

Overview

Presenting interdisciplinary research at the forefront of present advances in information technologies and their foundations, Scientific Applications of Language Methods is a multi-author volume containing pieces of work (either original research or surveys) exemplifying the application of formal language tools in several fields, including logic and discrete mathematics, natural language processing, artificial intelligence, natural computing and bioinformatics.

Read More Show Less

Product Details

  • ISBN-13: 9781848165441
  • Publisher: Imperial College Press
  • Publication date: 11/3/2010
  • Pages: 752
  • Product dimensions: 6.10 (w) x 9.00 (h) x 1.80 (d)

Table of Contents

1 Descriptional Complexity-An Introductory Survey M. Holzer M. Kutrib 1

1.1 Introduction 1

1.2 Descriptional Systems and Complexity Measures 3

1.3 Measuring Sizes 6

1.4 Measuring Resources 33

1.5 Non-Recursive Trade-Offs 39

References 51

2 Classifying All Avoidable Sets of Partial Words of Size Two F. Blanchet-Sadri B. Blakeley J. Gunter S. Simmons E. Weissenstein 59

2.1 Introduction 60

2.2 Preliminaries 62

2.3 Unavoidable Sets of Partial Words of Size Two 64

2.4 Canonical Forms 70

2.5 The Answer to the Conjectures 74

2.6 The Classification 95

2.7 Conclusion 99

References 100

3 On Glushkov K-graphs P. Caron M. Flouret 103

3.1 Introduction 103

3.2 Definitions 105

3.3 Acyclic Glushkov WFA Properties 114

3.4 Glushkov K-graph with Orbits 124

3.5 Algorithm for Orbit Reduction 127

3.6 Conclusion 131

References 131

4 Natural Language Dictionaries Implemented as Finite Automata J. Daciuk J. Piskorski S. Ristov 133

4.1 Dictionaries as Finite Automata 133

4.2 Automata as Mappings 149

4.3 Construction Methods 165

4.4 Internal Structure and Compression 187

References 200

5 Tree-Language Based Querying of Hierarchically Structured and Semi-Structured Data A. Berlea 205

5.1 Introduction 205

5.2 Preliminaries 207

5.3 Regular Forest Languages 217

5.4 Grammar Queries 230

5.5 Practical Application: A Pattern Language for XML Querying 259

5.6 Online Querying 275

5.7 Summary and Outlook 294

5.8 Proofs of Theorems 295

References 306

6 Quotient Monoids and Concurrent Behaviours R. Janicki J. Kleijn M. Koutny 313

6.1 Introduction 314

6.2 Preliminaries 318

6.3 Partial Orders and Order Structures 326

6.4 Mazurkiewicz Traces 334

6.5 Comtraces 337

6.6 Generalised Comtraces 354

6.7 Elementary Net Systems 360

6.8 EN-systems with Inhibitor and Mutex Arcs 372

6.9 Concluding Remarks 382

References 383

7 Correction Queries in Active Learning C. Tîrnauca 387

7.1 Introduction 387

7.2 Preliminaries 389

7.3 Learning Models 391

7.4 Learning with Correction Queries 393

7.5 Polynomial Time Learning with Correction Queries 403

References 416

8 Applications of Grammatical Inference in Software Engineering: Domain Specific Language Development M. Mernik D. Hrncic B. R. Bryant F. Javed 421

8.1 Introduction 422

8.2 Analysis Phase of DSL Development 424

8.3 Design Phase of DSL Development 426

8.4 Grammatical Inference and Language Design 429

8.5 Case Study 445

8.6 Related Work 448

8.7 Conclusion 452

References 453

9 Small Size Insertion and Deletion Systems A. Alhazov A. Krassovitskiy Y. Rogozhin S. Verlan 459

9.1 Introduction 459

9.2 Definitions 461

9.3 Basic Simulation Principles 466

9.4 Insertion-Deletion Systems with Rules of Small Size 470

9.5 Context-Free Insertion-Deletion Systems 472

9.6 One-Sided Contextual Insertion-Deletion Systems 481

9.7 Pure Insertion Systems 497

9.8 Graph-Controlled Insertion-Deletion Systems 503

9.9 Graph-Controlled Insertion-Deletion Systems with Priorities 514

9.10 Bibliographical Remarks 520

References 521

10 Accepting Networks of Evolutionary Word and Picture Processors: A Survey F. Manea C. Martín-Vide V. Mitrana 525

10.1 Introduction 525

10.2 Basic Definitions 527

10.3 Computational Power 536

10.4 Universal ANEPs and ANEPFCs 541

10.5 A Direct Simulation 544

10.6 Accepting Networks of Splicing Processors 545

10.7 Problem Solving with ANEPs/ANEPFCs 548

10.8 Accepting Networks of Picture Processors 549

References 558

11 Quantum Automata and Periodic Events C. Mereghetti B. Palano 563

11.1 Introduction 563

11.2 Preliminaries 566

11.3 Testing Periodicity on Unary 1qfa's 570

11.4 Synthesis of 1qfa's Inducing Periodic Events 572

11.5 Application to Periodic Languages 580

References 582

12 Soliton Circuits and Network-Based Automata: Review and Perspectives M. Bartha M. Krész 585

12.1 Introduction 586

12.2 Basic Concepts 588

12.3 Soliton Graphs and Automata 593

12.4 Elementary Decomposition of Soliton Graphs and Automata 597

12.5 Characterizing Soliton Automata 600

12.6 Complete Systems of Soliton Automata 610

12.7 Algorithms for Soliton Automata 615

12.8 Extensions of the Model and Further Research 623

12.9 Summary 627

References 628

13 Inferring Leadership Structure from Data on a Syntax Change in English W. Garrett Mitchener 633

13.1 Introduction 634

13.2 The Available Data 639

13.3 Formulation of the Variable Influence Model 640

13.4 Fitting the Do-support Data 644

13.5 Results and Discussion 650

13.6 Future Directions 652

13.7 Conclusion 656

References 658

14 Weighted Automata Modeling for High Density Linkage Disequilibrium Mapping T. Trang 663

14.1 Introduction 664

14.2 Biological Problem and Formulation 667

14.3 Fundamentals of Discrete Structures 676

14.4 Variable Length Finite Automata (VLFA) 682

14.5 Experimental Results on SNP Data 706

14.6 Conclusion 719

References 720

Author Index 723

Subject Index 725

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)