Equations and regular-like expressions for afa

DOI10.1080/00207169408804276zbMATH Open0832.68073OpenAlexW1981035324MaRDI QIDQ4839734FDOQ4839734

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

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.

zbMATH Keywords

regular expressionsalternating finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Derivatives of Regular Expressions
• Alternation
• Title not available (Why is that?)
• On equations for regular languages, finite automata, and sequential networks
• Constructions for alternating finite automata^∗
• From regular expressions to deterministic automata

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)