Equations and regular-like expressions for afa

DOI10.1080/00207169408804276MaRDI QIDQ4839734zbMATH OpenOpenAlexFDO

Authors Abdelaziz Fellah

Publication date 17 July 1995

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169408804276

zbMATH Keywords

regular expressionsalternating finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Alternating finite automata and star-free languages
• Efficient implementation of regular languages using reversed alternating finite automata
• Language equations for timed alternating finite automata
• scientific article; zbMATH DE number 1472276
• Nondeterministic regular expressions as solutions of equational systems.

Cites work

• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• Alternation
• Constructions for alternating finite automata^∗
• Derivatives of Regular Expressions
• From regular expressions to deterministic automata
• On equations for regular languages, finite automata, and sequential networks

This page was built for publication: Equations and regular-like expressions for afa

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4839734)