Finite Automata Accepting Star-Connected Languages

DOI10.1007/978-3-540-76336-9_31MaRDI QIDQ3503921zbMATH OpenOpenAlexFDO

Authors Barbara Klunder

Publication date 10 June 2008

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-76336-9_31

zbMATH Keywords

finite automatonstar-connected languagetrace monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Characterization of Star-Connected Languages Using Finite Automata
• Star-connected flat languages and automata
• On star-connected flat languages
• scientific article; zbMATH DE number 988805
• scientific article; zbMATH DE number 3874645

Cited in

(5)

• Alternating finite automata and star-free languages
• Characterization of Star-Connected Languages Using Finite Automata
• scientific article; zbMATH DE number 1408339 (Why is no real title available?)
• On star-connected flat languages
• Star-connected flat languages and automata

This page was built for publication: Finite Automata Accepting Star-Connected Languages

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