Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

LATA

2010

Springer

2010

Springer

Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infiniteness of the alphabet by adding to the automaton a set of registers or pebbles, or by attributing the alphabet by labels from an auxiliary finite alphabet that is read by an intermediate transducer. These formalisms involve a complicated mechanism on top of the transition function of automata over finite alphabets and are therefore difficult to understand and to work with. We introduce and study variable finite automata over infinite alphabets (VFA). VFA form a natural and simple extension of regular (and -regular) automata, in which the alphabet consists of letters as well as variables that range over the infinite alphabet domain. Thus, VFAs have the same structure as regular automata, only that some of the transitions are labeled by variables. We compare VFA with existing formalisms, and study their closure ...

Related Content

Added |
09 Aug 2010 |

Updated |
09 Aug 2010 |

Type |
Conference |

Year |
2010 |

Where |
LATA |

Authors |
Sarai Sheinvald, Orna Grumberg, Orna Kupferman |

Comments (0)