Efficient automaton-based recognition for linear conjunctive languages

DOI10.1007/3-540-44977-9_16MaRDI QIDQ4418613zbMATH OpenFDO

Authors Alexander Okhotin

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2608/26080169.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Recommendations

• EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
• On the equivalence of linear conjunctive grammars and trellis automata
• Automaton representation of linear conjunctive languages
• A recognition and parsing algorithm for arbitrary conjunctive grammars.
• Comparing linear conjunctive languages to subfamilies of the context-free languages

Cited in

(8)

• Space-efficient recognition of sparse self-reducible languages
• Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
• Language Recognition Power and Succinctness of Affine Automata
• Automaton representation of linear conjunctive languages
• On the equivalence of linear conjunctive grammars and trellis automata
• EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
• Efficient recognition algorithms for boundary and linear eNCE graph languages
• Conjunctive grammars, cellular automata and logic

This page was built for publication: Efficient automaton-based recognition for linear conjunctive languages

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