Quasi-deterministic virtual finite automaton (QDVFA) of order s

MaRDI QIDQ2878043zbMATH OpenFDO

Authors A. Jain, J.-S. Lee

Publication date 28 August 2014

Published in Journal of Algebra and Discrete Structures (Search for Journal in Brave)

zbMATH Keywords

formal languagesquasi-deterministic finite automatonvirtual deterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)
• Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar
• Quasi-deterministic finite automaton (QDFA)
• Semi-deterministic virtual finite automaton (SDVFA) of order \((s,t)\)
• scientific article; zbMATH DE number 7723593
• scientific article; zbMATH DE number 6475964
• Approximate determinization of quantitative automata
• Language processing by QDVFA of order ``\(s\)
• A notion of virtual deterministic finite automaton (VDFA) in language processing
• \(\alpha\)-grammar and quasi-deterministic pushdown automata (QDPDA) of order ``\(n\)

Cited in

(1)

• Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)

This page was built for publication: Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)

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