My keyboard doesnt support or have language that i wish to use

I have wireless/bluetooth keyboard but it doesn’t have/support my native language and it’s layout.
is there are a way to add language to keyboard language settings?
Someone help pls

automata – Having trouble understanding how to prove a language context free?

I’ve been studying the theory of automata. I came across this problem in the book and unable to understand how to solve this. I’ve solved some examples using the Pumping lemma but this one uses Backward Operation.

Let B be the language {w|w = BW(w) and has equal number of a's and b's}, where Σ={a,b} and BW(L)={cn,…c0∣c0,…cn ∈ L},c^i∈Σ. Prove that language B is not a context-free language.

Help would be highly appreciated.

Language specific command injection keywords

I was wondering which system shell commands from different languages might be used in a command injection or let’s put it this way, which are the ones to expect in a malign path of an URL. OS specific commands, sure and that could be a long list. But what about language specific apis?

Java: Runtime.exec
PHP:  exec, eval
.
.

These functions are often targeted, for eval it’s even suggested to not use it at all.

exec('whoami')

This is a simple example from the command injection payload list on git. I first thought I could only expect the exec() during a code review not on the actual attack payload because as an attacker I’m only able to modify the input of exec or at least that was my humble understanding from this.
Could someone enlighten me pls and what are truly language related differences within this attack vector?

web – Should end-users enter Dates or Numbers based on their browser locales vs based on the page content language?

I have a website for international users. Let’s say the website supports English users only ( All texts on the website are English words ). The website has a submit form that the end-users of the website need to enter Dates, Integers, and Decimals. At back-end side, I will convert all the text-based fields: Date, Integer, and Decimals to Date, Integer, Double objects.

My question is: What kind of Locale I should use to convert all text-based fields to Date, Integer, Double objects?

I have 2 choices: The first choice is I will always use US-Locale for the conversions. The second choice is I will use the end-user browsers setting locales (Request Locales).

If I use the first choice, let’s say the French, Japanese, … etc. users must always enter US Locale Date, Integer, Decimals formats.

If I use the second choice, the French users can enter French Locale Date, Integer, Decimals formats, the Japanese users can enter Japanese Locale Date, Integer, Decimals formats, … etc.

I know each of choice has its own pros an cons. but I would like to know which choice is recommended.

Thanks!

Design for multi language support in sharepoint

I am implementing a new sharepoint application, but the requirement is to have support for multi language on sharepoint forms.
The data stored in list columns should be multi language in different lists but in same site collection.
I want to know if we can have this possible and any thoughts on the approach i need to look at to start with.

Appreciate your inputs on this.

Thanks & Regards,
Usha.

Facebook M2M-100 Language Translation Model Now Open Sourced

Facebook has a new AI multilingual, 100 language translation model, M2M-100, which it releasing to open source.

What language is generated by this grammar?

Describe the language, generated by the grammar G with such production rules:

$$begin{align*}
S&to aSaSmid bSbSmid
epsilonend{align*}$$

Is there only one unique DPDA that accepts a specific language?

Or is it possible to construct more than one DPDA that accepts exactly the same language?

how to teach the console the markup language

is there a way to teach the console the markup language?

/bin/bash
echo "This is *Important* Stuff"

to show up as:

This is Important Stuff

finite automata – Using pumping lemma to show that there is always a smaller word for a regular language

I’m having trouble putting together a mathematical proof that uses the Pumping Lemma to show that $exists $n $geqslant$ 1 such that that for all strings w $in$ L such that |w| $geqslant$ n, there is another string z $in$ L such that |z| < n.

L is a regular language in this case.

I understand its saying that for any string in a regular language there can be a shorter version of it to an extent. But I’m not sure how to begin using the pumping lemma to show this. I have used the pumping lemma to show something is not regular, but I haven’t done a proof like this before…