Multiple Keyword Patterns in Context-Free Languages

Pál Dömösi () and Masami Ito ()
Additional contact information
Pál Dömösi: Lajos Kossuth University, Institute of Mathematics and Informatics
Masami Ito: Kyoto Sangyo University, Faculty of Science

Chapter Chapter 21 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 237-241 from Springer

Abstract: Abstract A polynomial algorithm is shown to solve the following problem: Given a context-free language L and a finite list of nonempty words w 1,..., w n , let us decide whether or not there are words z 0,..., z n having z 0 w 1 z 1... w n z n ∈ L(G).

Keywords: Text String; Terminal Symbol; Nonempty Word; Finite List; Emptiness Problem (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_21

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().