Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
13
views
18
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,696
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages, and Programming
Efficient Separability of Regular Languages by Subsequences and Suffixes
other
Author(s):
Wojciech Czerwiński
,
Wim Martens
,
Tomáš Masopust
Publication date
(Print):
2013
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
African Languages
Most cited references
18
Record
: found
Abstract
: not found
Article
: not found
Ordering by Divisibility in Abstract Algebras
Graham Higman
(1952)
0
comments
Cited
141
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Complexity of Some Problems on Subsequences and Supersequences
David Maier
(1978)
0
comments
Cited
58
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
nSPARQL: A navigational language for RDF
Claudio Gutierrez
,
Marcelo Arenas
,
Jorge Pérez
(2010)
0
comments
Cited
17
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2013
Pages
: 150-161
DOI:
10.1007/978-3-642-39212-2_16
SO-VID:
9e75a74b-9f68-4797-841b-532c903e3392
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 37
Decision Problems for Additive Regular Functions
pp. 49
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
pp. 74
Complexity of Two-Variable Logic on Finite Trees
pp. 150
Efficient Separability of Regular Languages by Subsequences and Suffixes
pp. 174
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
pp. 385
Coeffects: Unified Static Analysis of Context-Dependence
pp. 472
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
pp. 657
Temporal Network Optimization Subject to Connectivity Constraints
Similar content
2,696
Nonauditory suffix effects in congenitally deaf signers of American Sign Language.
Authors:
E Klima
,
M A Shand
Suffix-tree analyser (STAN): looking for nucleotidic and peptidic patterns in chromosomes.
Authors:
Jacques Nicolas
,
Grégory Ranchy
,
Sébastien Tempel
…
Spelling approximate repeated or common motifs using a suffix tree
Authors:
Marie Sagot
See all similar
Cited by
9
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
Authors:
Thomas Place
,
Marc Zeitoun
Separating Regular Languages by Piecewise Testable and Unambiguous Languages
Authors:
Thomas Place
,
Lorijn van Rooijen
,
Marc Zeitoun
On Upper and Lower Bounds on the Length of Alternating Towers
Authors:
Štěpán Holub
,
Galina Jirásková
,
Tomáš Masopust
See all cited by