On the Square Root of Languages

A. Bertoni and P. Massazza
Additional contact information
A. Bertoni: Università degli Studi di Milano, Dipartimento di Scienze dell’Informazione
P. Massazza: Università degli Studi di Milano, Dipartimento di Scienze dell’Informazione

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 125-134 from Springer

Abstract: Abstract The unambiguous square root of a language L ⫃ Σ* is a language X s.t. X 2 = L and the product is unambiguous. We prove that: 1. Every language admits at most one unambiguous square root 2. For the class of regular languages, it is decidable whether the unambiguous square root is regular; the same problem becomes undecidable for the class of context-free languages 3. The unambiguous square root of a language in P is in P

Keywords: Polynomial Time; Formal Power Series; Formal Series; Regular Language; Counting Function (search for similar items in EconPapers)
Date: 2000
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-3-662-04166-6_11

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

DOI: 10.1007/978-3-662-04166-6_11

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 ().