Towards Nominal Formal Languages

Details Towards Nominal Formal Languages Towards Nominal Formal Languages

2011-02-15

arxiv.org/abs/1102.3174v2

Computer Science

Formal Languages and Automata Theory

Scientific paper

We introduce formal languages over infinite alphabets where words may contain
binders. We define the notions of nominal language, nominal monoid, and nominal
regular expressions. Moreover, we extend history-dependent automata
(HD-automata) by adding stack, and study the recognisability of nominal
languages.

Affiliated with

Also associated with

No associations

Rating

Towards Nominal Formal Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards Nominal Formal Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Nominal Formal Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416149