Standard

Efficient automaton-based recognition for linear conjunctive languages. / Okhotin, Alexander.

Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers. ред. / Jean-Marc Champarnaud; Denis Maurel. Том 2608 2003. стр. 169-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная › Рецензирование

Harvard

Okhotin, A 2003, Efficient automaton-based recognition for linear conjunctive languages. в J-M Champarnaud & D Maurel (ред.), Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers. Том. 2608, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), стр. 169-181. https://doi.org/10.1007/3-540-44977-9_16

APA

Okhotin, A. (2003). Efficient automaton-based recognition for linear conjunctive languages. в J-M. Champarnaud, & D. Maurel (Ред.), Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers (Том 2608, стр. 169-181). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-44977-9_16

Vancouver

Okhotin A. Efficient automaton-based recognition for linear conjunctive languages. в Champarnaud J-M, Maurel D, Редакторы, Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers. Том 2608. 2003. стр. 169-181. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-44977-9_16

Author

Okhotin, Alexander. / Efficient automaton-based recognition for linear conjunctive languages. Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers. Редактор / Jean-Marc Champarnaud ; Denis Maurel. Том 2608 2003. стр. 169-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inbook{198015d154b542508c1e2168fae6d09d,
title = "Efficient automaton-based recognition for linear conjunctive languages",
abstract = "This paper studies practical algorithms for dealing with a particular family of cellular automata, which has recently been proved computationally equivalent to linear conjunctive grammars. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. In this paper, an algorithm for converting an arbitrary linear conjunctive gram-mar to an equivalent automaton is proposed, and different techniques of reducing the size of existing automata are studied.",
author = "Alexander Okhotin",
year = "2003",
doi = "10.1007/3-540-44977-9_16",
language = "English",
volume = "2608",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "169--181",
editor = "Jean-Marc Champarnaud and Denis Maurel",
booktitle = "Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers",

}

RIS

TY - CHAP

T1 - Efficient automaton-based recognition for linear conjunctive languages

AU - Okhotin, Alexander

PY - 2003

Y1 - 2003

N2 - This paper studies practical algorithms for dealing with a particular family of cellular automata, which has recently been proved computationally equivalent to linear conjunctive grammars. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. In this paper, an algorithm for converting an arbitrary linear conjunctive gram-mar to an equivalent automaton is proposed, and different techniques of reducing the size of existing automata are studied.

AB - This paper studies practical algorithms for dealing with a particular family of cellular automata, which has recently been proved computationally equivalent to linear conjunctive grammars. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. In this paper, an algorithm for converting an arbitrary linear conjunctive gram-mar to an equivalent automaton is proposed, and different techniques of reducing the size of existing automata are studied.

UR - http://www.scopus.com/inward/record.url?scp=35248835707&partnerID=8YFLogxK

U2 - 10.1007/3-540-44977-9_16

DO - 10.1007/3-540-44977-9_16

M3 - Chapter

AN - SCOPUS:35248835707

VL - 2608

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 169

EP - 181

BT - Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers

A2 - Champarnaud, Jean-Marc

A2 - Maurel, Denis

ER -

ID: 78926284