Automata and rational expressions

2015/02/12 by Jacques Sakarovitch, Sakarovitch, Jacques · 1 citation
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL

paper · pdf · doi:10.48550/arxiv.1502.03573

arxiv created 2015/02/12 · arxiv updated 2015/02/13

Abstract

This text is an extended version of the chapter 'Automata and rational expressions' in the AutoMathA Handbook that will appear soon, published by the European Science Foundation and edited by JeanEricPin.

Cited by

• General Decidability Results for Systems with Continuous Counters

Related

• Lecture Notes on Automata, Languages, and Grammars
• Derived-term Automata for Extended Weighted Rational Expressions
• Construction of rational expression from tree automata using a generalization of Arden's Lemma
• Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
• 10501 Executive Summary – Advances and Applications of Automata on Words and Trees