## untagged – Is there any way to move and take a job (as a barista) in the United States as a foreigner?

I am considering moving and working in the United States for a period of three months.

However the job position that I would like to apply for (barista) does not allow me to get a work visa.
(I am not a citizen or permanent resident of the United States so in order to start working I need to provide an Employment Authorization Document as well as a Social Security card which require having this type of visa first). I wanted to ask what kind of visa I could apply for in my situation or if there would be any other way to make it happen?

## visas – Does the United States Department of State issue any US record clearance letter?

I am a French citizen, US permanent resident, California resident, and currently located in California, US. I am applying for a visa: the visa application requires a letter of verification stating that the applicant has no criminal record. In my case, the embassy of the country I am applying the visa for is telling me that they accept the following two options to obtain the US record clearance letter:

1. From the FBI
2. From the State Department (a.k.a. United States Department of State)

I know how to do it for the FBI, but I couldn’t find information on how to get such a letter directly from the United States Department of State.

## database design – multiple inconsistent states and multiple deadlocks

Do these plural ‘states’ and ‘deadlocks’ mean that multiple inconsistent states and multiple deadlocks may occur? If they were singular (an inconsistent state, a deadlock) then would there be only one of them at a time, please?

If we do not use locking, or if we unlock data items too soon after
reading or writing them, we may get inconsistent states. On the
other hand, if we do not unlock a data item before requesting a lock
on another data item, deadlocks may occur.

Database System Concepts

## 8 – Edit Field in Custom Content by adding #states property

I have custom content and there are fields, for example field “dog_name”. I declared those fields in .yml files. I have a question – is it possible to edit them programmatically and add to them `#states` property? I need one field showing after choose particular option in other field. I found how to do it with forms, but i need to do it with fields. I know that Drupal has conditional module, but I need to implement it without any external modules.

## design – How to avoid repeating same states in a finite state machine implementation?

I have been implementing a finite state machine which basically ensures configuration of the external chip which communicates with my MCU via I2C. The skeleton of the configuration state machine looks like this:

Whereas the Configure Register N states are state machines in their own.
It is pretty simple state diagram but there is one complication. The chip can asynchronously generate a “fault” event which is signalized via assertion of the “fault” pin. State of the fault pin is read with the same period with which the state machine is executed. Service of the fault pin activation is based on another state machine. So the basic state diagram incorporating the fault pin activation service looks like this:

At first glance there are several repeating patterns in the state diagram. At first the state diagram for the register configuration and secondly the state diagram for fault pin activation handling. I would
like to exploit these patterns and avoid of repeating the same code at several places. Can anybody suggest me any solution?

## logic – What set of states does this formula characterize?

The given condition rule is that

σ satisfies ∀x.f if and only if for every
integer n, σ satisfies f[n/x]

And I have to find out “What set of states does the formula ‘∀x.x = 3’ characterize?”

I am confused about the correct answer My reasoning is

So, by the given rule since x=3 is valid only when n=3. So the set of states this formula characterize will be a set of 1 state that is {x=3}

Or should the correct answer would be

This formula does not satisfy any state because it is not true for all integers n and set the set of state it characterize will be an empty set.

I am not sure which one of these answers should be correct. Can someone point me towards the correct answer. I feel like the second answer makes more sense because if the question was about for some ∃x x=3, then it would characterize the set of one state.

## How do I specify 48 states as my service areas in Google My Business?

y u no do it?

Advertise virtually anything here, with CPM banner ads, CPM email ads and CPC contextual links. You can target relevant areas of the site and show ads based on geographical location of the user if you wish.

Starts at just \$1 per CPM or \$0.10 per CPC.

## time complexity – Simultaneous reachability of NFA states

Suppose I have a $$n$$-state non-deterministic finite automaton $$F$$ over alphabet $$Sigma$$. Let $$S(x)$$ be the set of states reachable from the starting state by consuming string $$x$$.

I am interested for a given NFA to compute a $$n times n$$ simultaneous reachability matrix $$R$$, such that $$R_{ij} = (exists x : {i, j} subseteq S(x))$$.

From NFA product construction of $$F$$ with itself and then checking the reachability from the starting state I can compute $$R$$ in $$O(n^4 cdot |Sigma|)$$ time. Is there a better algorithm?

## html – Identifying states when using state machine to validate a form field

Scenario is simple, a password field with few validation rules.

The states I came up with are

• default ( when the form loads or reset button is pressed)
• filled ( should this even be a state ?)
• valid ( date is present with all rules satisfied)
• invalid (data is there but not meeting the rules )

Error message is displayed based on the current state.

For example,

• default state, user didn’t enter any data yet, so logical it is an invalid state (assuming the field is required) but we do not want to show errors to the user right away after opening the form (that will be horrible ux, right ?) so I added the default state specifically for that purpose.

Secondly, there seems to be arbitrary states Like

They look like states to me but are they?

Lastly, can we say

• submitted is also a state ?
• invalid after submitted due to error in API call ( maybe API team added a new rule we didn’t know).

Million dollar questions are,

Am I even thinking in the right direction to implement validation this way?
Is there any states I am missing or overdoing?
Is this right? Can it be further simplified or is there a state I am missing?

P.s. (this question is about how to infer states from a problem and not about how to actually implementing it in code. I know and have used xstate lib).

## Determine the number of reachable states in a subset construction?

Is there a method to determine the number of reachable states in the subset construction of a NFA to a DFA without having to construct the entire DFA?