Closure of finite-state automaton languages

DOI10.1016/0165-0114(94)00388-NMaRDI QIDQ1920338zbMATH OpenOpenAlexFDO

Authors Lan Su, Zhiwen Mo

Publication date 25 August 1996

Published in Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-0114(94)00388-n

zbMATH Keywords

fuzzy finite-state automaton languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Closure properties of languages recognized by strictly k-edge finite state automata
• Regular Closure of Deterministic Languages
• Closure of tree automata languages under innermost rewriting
• A closure property of regular languages
• scientific article; zbMATH DE number 3919849
• Closure of Hedge-Automata Languages by Hedge Rewriting
• Congruent closure algorithms for finite automata and some applications
• scientific article; zbMATH DE number 4057034
• Finite-state \(\omega\)-languages
• scientific article; zbMATH DE number 3158402

Cited in

(9)

• A closure property of regular languages
• Minimization algorithm of fuzzy finite automata.
• Finite turns and the regular closure of linear context-free languages
• The relationships among several types of fuzzy automata
• Closure properties of languages recognized by strictly k-edge finite state automata
• Closure properties of hyper-minimized automata
• Homomorphisms of fuzzy recognizers
• scientific article; zbMATH DE number 3919849 (Why is no real title available?)
• Rewrite Closure and CF Hedge Automata

This page was built for publication: Closure of finite-state automaton languages

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