Sciweavers

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

111

FUIN
2010

98views more FUIN 2010»

A Note on Two-pebble Automata Over Infinite Alphabets

15 years 5 days ago

A Note on Two-pebble Automata Over Infinite Alphabets

Download homepages.inf.ed.ac.uk

It is shown that the emptiness problem for 2-PA languages is undecidable and that 2-PA are weaker than 3-PA.

Michael Kaminski, Tony Tan

Real-time Traffic

Emptiness Problem | FUIN 2010 |

claim paper

Related Content

» Tree Automata over Infinite Alphabets

» Variable Automata over Infinite Alphabets

» Automata and Logics for Words and Trees over an Infinite Alphabet

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

» ForwardXPath and extended register automata on datatrees

» Inapproximability of Nondeterministic State and Transition Complexity Assuming PNP

» Automata vs Logics on Data Words

Post Info
More Details (n/a)

Added	02 Mar 2011
Updated	02 Mar 2011
Type	Journal
Year	2010
Where	FUIN
Authors	Michael Kaminski, Tony Tan

Comments (0)