Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar

zbMATH Open1331.68134MaRDI QIDQ2878045

A. Jain, K.-S. Lee

Publication date: 28 August 2014

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

zbMATH Keywords

formal languagesregular grammarquasi-deterministic virtual finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

QRT FIFO automata, breadth-first grammars and their relations ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) ⋮ Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)

This page was built for publication: Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar

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