Sciweavers

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

12

MFCS
2001
Springer

favoriteEmaildiscussreport

99views Theoretical Computer Science» more MFCS 2001»

Automata on Linear Orderings

13 years 9 months ago

Automata on Linear Orderings

Download www.liafa.jussieu.fr

We consider words indexed by linear orderings. These extend ﬁnite, (bi-)inﬁnite words and words on ordinals. We introduce ﬁnite automata and rational expressions for these words. We prove that for countable scattered linear orderings, these two notions are equivalent. This result extends Kleene’s theorem.

Véronique Bruyère, Olivier Carton

Real-time Traffic

Bi-)inﬁnite Words | Countable Scattered Linear | Linear Orderings | MFCS 2001 | Theoretical Computer Science |

claim paper

Related Content

» Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank

» A Sufficient Completeness Checker for Linear OrderSorted Specifications Modulo Axioms

» A Practical Linear Time Algorithm for Trivial Automata Model Checking of HigherOrder Recur...

» Factorization forests for infinite words and applications to countable scattered linear or...

» An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Sys...

» Automata and temporal logic over arbitrary linear time

» Marrying Words and Trees

» Partial Order Reduction for Model Checking of Timed Automata

» Emptiness of Multipushdown Automata Is 2ETIMEComplete

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	MFCS
Authors	Véronique Bruyère, Olivier Carton

Comments (0)