An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression-Reference-Cited by-同舟云学术

An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression

Published: Issue: Volume: Page:145-156
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Champarnaud Jean-Marc,Ouardi Faissal,Ziadi Djelloul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-73208-2_16.pdf

Reference27 articles.

1. Lecture Notes in Computer Science;C. Allauzen,2006

2. Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155, 291–319 (1996)

3. Brüggemann-Klein, A.: Regular Expressions into Finite Automata. Theoret. Comput. Sci. 120, 197–213 (1993)

4. Berstel, J., Reutenauer, C.: Les séries rationnelles et leurs langages. In: Études et recherches en informatique, Masson, Paris, 1984, Springer, Berlin Heidelberg English version: Rational series and their languages (1988)

5. Caron, P., Flouret, M.: Glushkov construction for series: The non commutative case. Intern. Journ. Comput. Maths 80(4), 457–472 (2003)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Manipulation of Regular Expressions Using Derivatives: An Overview;Implementation and Application of Automata;2022

2. Derived-Term Automata of Weighted Rational Expressions with Quotient Operators;Theoretical Aspects of Computing – ICTAC 2017;2017

3. Derived-Term Automata of Multitape Rational Expressions;Implementation and Application of Automata;2016

4. Derived-Term Automata for Extended Weighted Rational Expressions;Theoretical Aspects of Computing – ICTAC 2016;2016