scientific article; zbMATH DE number 1542833

MaRDI QIDQ4520282zbMATH OpenFDO

Authors Alexandru Mateescu, Kai Salomaa, Arto Salomaa

Publication date 26 February 2001

Full work available at URL http://www.jucs.org/jucs_1_5/lexical_analysis_with_a

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Intuitionistic fuzzy lexical analyzer
• scientific article; zbMATH DE number 2150274
• scientific article; zbMATH DE number 3978425
• On the relation between fuzzy regular expression and fuzzy finite state automaton
• A fast method of lexical analysis

Cited in

(18)

• Fuzzy automaton induction using neural network
• Introducing synchrony in fuzzy automata
• Abstraction and approximation in fuzzy temporal logics and models
• On the applicability of the longest-match rule in lexical analysis.
• Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
• Crisp-determinization of weighted tree automata over strong bimonoids
• On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• On minimal realization of fuzzy behaviour and associated categories
• Algebraic aspects of families of fuzzy languages
• Characterizations of complete residuated lattice-valued finite tree automata
• Weighted synchronous automata
• Intuitionistic fuzzy lexical analyzer
• Reduction of BL-general L-fuzzy automata
• Minimal and statewise minimal intuitionistic general L-fuzzy automata
• Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
• Algebraic properties on the cuts of lattice-valued regular languages
• A fast method of lexical analysis

This page was built for publication:

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