[2309.08720v1] Latvian Quantum Finite State Automata for Unary Languages
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:2309.08720v1 (cs)
[Submitted on 15 Sep 2023]

Title:Latvian Quantum Finite State Automata for Unary Languages

Authors:Carlo Mereghetti (University of Milan, Dept. Comp. Sci.), Beatrice Palano (University of Milan, Dept. Comp. Sci.), Priscilla Raucci (University of Milan, Dept. Comp. Sci.)
View PDF
Abstract:We design Latvian quantum finite state automata (LQFAs for short) recognizing unary regular languages with isolated cut point 1/2. From an architectural point of view, we combine two LQFAs recognizing with isolated cut point, respectively, the finite part and the ultimately periodic part of any given unary regular language L. In both modules, we use a component addressed in the literature and here suitably adapted to the unary case, to discriminate strings on the basis of their length. The number of basis states and the isolation around the cut point of the resulting LQFA for L exponentially depends on the size of the minimal deterministic finite state automaton for L.
Comments: In Proceedings NCMA 2023, arXiv:2309.07333
Subjects: Formal Languages and Automata Theory (cs.FL)
ACM classes: F.1.1
Cite as: arXiv:2309.08720 [cs.FL]
  (or arXiv:2309.08720v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.2309.08720
Journal reference: EPTCS 388, 2023, pp. 63-78
Related DOI: https://doi.org/10.4204/EPTCS.388.8

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 15 Sep 2023 19:14:08 UTC (314 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2023-09
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)