Deciding whether the frontier of a regular tree is scattered

Stephen L. Bloom, Z. Ésik

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The article discusses the methods to decide whether the frontier of regular tree is scattered or not. Some new descriptions of the natural classes of regular words and the scattered regular words, related to properties of regular sets of binary strings are presented. It is shown that there is a polynomial time algorithm to decide whether the word is scattered or not.

Original languageEnglish
Pages (from-to)1-21
Number of pages21
JournalFundamenta Informaticae
Volume55
Issue number1
Publication statusPublished - Apr 2003

Fingerprint

Polynomials
Regular Sets
Polynomial-time Algorithm
Strings
Binary
Class

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Applied Mathematics
  • Safety, Risk, Reliability and Quality

Cite this

Deciding whether the frontier of a regular tree is scattered. / Bloom, Stephen L.; Ésik, Z.

In: Fundamenta Informaticae, Vol. 55, No. 1, 04.2003, p. 1-21.

Research output: Contribution to journalArticle

@article{6a0baa0d4e6744d38956d22057b410ce,
title = "Deciding whether the frontier of a regular tree is scattered",
abstract = "The article discusses the methods to decide whether the frontier of regular tree is scattered or not. Some new descriptions of the natural classes of regular words and the scattered regular words, related to properties of regular sets of binary strings are presented. It is shown that there is a polynomial time algorithm to decide whether the word is scattered or not.",
author = "Bloom, {Stephen L.} and Z. {\'E}sik",
year = "2003",
month = "4",
language = "English",
volume = "55",
pages = "1--21",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1",

}

TY - JOUR

T1 - Deciding whether the frontier of a regular tree is scattered

AU - Bloom, Stephen L.

AU - Ésik, Z.

PY - 2003/4

Y1 - 2003/4

N2 - The article discusses the methods to decide whether the frontier of regular tree is scattered or not. Some new descriptions of the natural classes of regular words and the scattered regular words, related to properties of regular sets of binary strings are presented. It is shown that there is a polynomial time algorithm to decide whether the word is scattered or not.

AB - The article discusses the methods to decide whether the frontier of regular tree is scattered or not. Some new descriptions of the natural classes of regular words and the scattered regular words, related to properties of regular sets of binary strings are presented. It is shown that there is a polynomial time algorithm to decide whether the word is scattered or not.

UR - http://www.scopus.com/inward/record.url?scp=0038080919&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038080919&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0038080919

VL - 55

SP - 1

EP - 21

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1

ER -