scientific article; zbMATH DE number 1998341
From MaRDI portal
Publication:4432976
zbMATH Open1030.68059MaRDI QIDQ4432976FDOQ4432976
Authors: Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, M. Sciortino, Antonio Restivo 
Publication date: 29 October 2003
Title of this publication is not available (Why is that?)
Recommendations
Cited In (25)
- Title not available (Why is that?)
- Reactive automata
- Building phylogeny with minimal absent words
- Decision problems for convex languages
- Finite language forbidding-enforcing systems
- Forbidden patterns for ordered automata
- Recursive formula of enumeration on forbidden words
- Automata and differentiable words
- Using minimal absent words to build phylogeny
- Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
- Fast detection of specific fragments against a set of sequences
- Generalizations of code languages with marginal errors
- Forbidden traces and forbidden subtraces
- Words and forbidden factors
- Minimal forbidden subwords
- Deciding WQO for factorial languages
- Languages with a finite antidictionary: growth-preserving transformations and available orders of growth
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
- Codes, unambiguous automata and sofic systems.
- Generalizations of Code Languages with Marginal Errors
- Title not available (Why is that?)
- Decision Problems for Convex Languages
- Word assembly through minimal forbidden words
- Minimal absent words in rooted and unrooted trees
- Linear-time computation of generalized minimal absent words for multiple strings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432976)
