See this document in CiteSeerX!

Roots and Powers of Regular Languages (2002)  (Make Corrections)  (1 citation)
Sandor Horvath, Peter Leupold, Gerhard Lischke



  Home/Search   Context   Related

 
View or download:
pizarro.fll.urv.es/conting...RootPow.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pizarro.fll.urv.es/contin...veroe (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: For a set H of natural numbers, the H-power of a language L is the set of all words p where p 2 L and k 2 H . The root of L is the set of all primitive words p such that p belongs to L for some n  1. There is a strong connection between the root and the powers of a regular language L namely, the H-power of L for an arbitrary nite set H with 0; 1; 2 = 2 H is regular if and only if the root of L is nite. If the root is in nite then the H-power for most regular sets H is... (Update)

Similar documents based on text:   More   All
0.4:   Periodic Orbit Theory Applied to a Chaotically Oscillating Gas.. - Simon, al.   (Correct)
0.4:   Proving the Temporal Properties of the Unique World - Horváth, Achten.. (1999)   (Correct)
0.3:   On Some Properties of Context-Free Languages Related to Primitive .. - Leupold   (Correct)

BibTeX entry:   (Update)

S. Horvath, P. Leupold, and G. Lischke. Roots and powers of regular languages. In M. Ito and M. Toyama, editors, Proc. Developments in Language Theory 2002. http://citeseer.ist.psu.edu/horvath02roots.html   More

@misc{ horvath02roots,
  author = "S. Horvath and P. Leupold and G. Lischke",
  title = "Roots and powers of regular languages",
  text = "S. Horvath, P. Leupold, and G. Lischke. Roots and powers of regular languages.
    In M. Ito and M. Toyama, editors, Proc. Developments in Language Theory
    2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/horvath02roots.html" }
Citations (may not include all citations):
1911   Introduction to automata theory (context) - Hopcroft, Ullman - 1979
40   Weak second-order arithmetic and nite automata (context) - uchi - 1960
40   Combinatorics of words - Choffrut, Karhum
29   Representation of events in nerve nets and nite automata (context) - Kleene - 1956
27   Rational sets in commutative monoids (context) - Eilenberg, Sch - 1969
8   On formal properties of simple phrase structure grammars (context) - Bar-Hillel, Perles et al. - 1961
1   The power of one-letter rational languages - Cachat
1   Developments in Language Theory (context) - Kuich, Rozenberg et al. - 2001
1   The root of a language and its complexity (context) - Lischke
1   and period languages of rational (context) - Calbrix, Nivat - 1995
1   Decidable and undecidable problems of primitive words (context) - Horv, Ito - 1999
1   On classi cation and decidability problems of primitive word.. (context) - Horv, Kudlek - 1995

Documents on the same site (http://pizarro.fll.urv.es/continguts/linguistica/proyecto/loipi/veroe.html):   More
Languages of Partial Words - How to Obtain Them and What.. - Leupold (2004)   (Correct)
Partial Words for DNA Coding - Leupold   (Correct)
On Some Properties of Context-Free Languages Related to Primitive .. - Leupold   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC