English
Related papers

Related papers: State complexity of union and intersection combine…

200 papers

Entanglement characteristics of a pair coherent state is studied using entanglement of superposition. It is demonstrated only few states in the expansion of a pair coherent state, in a harmonic oscillator basis, contribute significantly to…

Quantum Physics · Physics 2007-08-06 Jitesh R. Bhatt , Prasanta K. Panigrahi

We investigate the state complexity of the shuffle operation on regular languages initiated by Campeanu et al. and studied subsequently by Brzozowski et al. We shift the problem into the combinatorics domain by turning the problem of state…

Formal Languages and Automata Theory · Computer Science 2019-05-21 Pascal Caron , Jean-Gabriel Luque , Bruno Patrou

The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most…

Formal Languages and Automata Theory · Computer Science 2026-04-08 Arto Salomaa , Kai Salomaa , Taylor J. Smith

We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic…

Formal Languages and Automata Theory · Computer Science 2010-08-11 Xiaoxue Piao , Kai Salomaa

We consider the superpositions of spin coherent states and study the coherence properties and spin squeezing in these states. The spin squeezing is examined using a new version of spectroscopic squeezing criteria. The results show that the…

Quantum Physics · Physics 2009-11-07 Xiaoguang Wang

We examine the complexity of basic regular operations on languages represented by Boolean and alternating finite automata. We get tight upper bounds m+n and m+n+1 for union, intersection, and difference, 2^m+n and 2^m+n+1 for concatenation,…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Galina Jirásková

In this paper we consider the state complexity of an operation on formal languages, root(L). This naturally entails the discussion of the monoid of transformations of a finite set. We obtain good upper and lower bounds on the state…

Group Theory · Mathematics 2007-05-23 Bryan Krawetz , John Lawrence , Jeffery Shallit

This paper deals with the size complexity of minimal {\it two-way quantum finite automata} (2qfa's) necessary for operations to perform on all inputs of each fixed length. Such a complexity measure, known as state complexity of operations,…

Discrete Mathematics · Computer Science 2008-07-04 Daowen Qiu

A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is…

Formal Languages and Automata Theory · Computer Science 2018-01-04 Janusz A. Brzozowski , Sylvie Davies

A procedure is discussed for creating coherent superpositions of motional states of ion strings. The motional states are across the structural transition linear-zigzag, and their coherent superposition is achieved by means of spin-dependent…

We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free…

Formal Languages and Automata Theory · Computer Science 2017-01-16 Robert Ferens , Marek Szykuła

Coupled cluster theory in the standard formulation is unable to correctly describe conical intersections among states of the same symmetry. This limitation has restricted the practical application of an otherwise highly accurate electronic…

Chemical Physics · Physics 2024-12-25 Federico Rossi , Eirik F. Kjønstad , Sara Angelico , Henrik Koch

We find tight lower and upper bounds on the entanglement of a superposition of two bipartite states in terms of the entanglement of the two states constituting the superposition. Our upper bound is dramatically tighter than the one…

Quantum Physics · Physics 2009-11-13 Gilad Gour

We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This…

Formal Languages and Automata Theory · Computer Science 2017-10-19 Sylvie Davies

We perform a Bayesian analysis of probability measures for compact star equations of state using new, disjunct constraints for mass and radius. The analysis uses a simple parametrization for hybrid equations of state to investigate the…

High Energy Astrophysical Phenomena · Physics 2014-08-29 David Alvarez-Castillo , Alexander Ayriyan , David Blaschke , Hovik Grigorian

In this paper, we study the superposition invariance of unitary operators and maximally entangled state respectively. Furthermore, we discuss the set of orthogonal maximally entangled states. We find that orthogonal basis of maximally…

Quantum Physics · Physics 2015-10-23 Xin-Wei Zha , Yun-Guang Zhang , Jian-Xia Qi

Mixed states of samples of spin s particles which are symmetric under permutations of the particles are described in terms of their total collective spin quantum numbers. We use this description to analyze the influence on spin squeezing…

Quantum Physics · Physics 2007-05-23 Janus Wesenberg , Klaus Moelmer

This article reports on a program to obtain and understand coherent states for general systems. Most recently this has included supersymmetric systems. A byproduct of this work has been studies of squeezed and supersqueezed states. To…

High Energy Physics - Theory · Physics 2016-10-03 Michael Martin Nieto

We propose a new doorway to study the interplay between equations of state of dense matter and compact stars in gauge/gravity correspondence. For this we construct a bulk geometry near the boundary of five-dimensional spacetime. By solving…

High Energy Physics - Phenomenology · Physics 2015-06-05 Kyung Kiu Kim , Youngman Kim , Ik Jae Shin

In many physical applications, bound states and/or resonances are observed, which raises the question whether these states are elementary or composite. Here we elaborate on several methods for calculating the compositeness $X$ of bound…

Quantum Physics · Physics 2023-01-11 J. A. Oller