Journal of Automata, Languages and Combinatorics
- Journal of Automata, Languages and Combinatorics
Infobox Journal
title = Journal of Automata, Languages and Combinatorics
discipline = Computer Science
abbreviation = JALC
publisher = Otto-von-Guericke-Universität Magdeburg
country = Germany
frequency = Quarterly
history = 1965 to present (until 1994 named "Journal of Information Processing and Cybernetics / Elektronische Informationsverarbeitung und Kybernetik")
openaccess = no
website = http://www.jalc.de
ISSN = 1430-189X
The Journal of Automata, Languages and Combinatorics (JALC) is a computer science journal edited by Jürgen Dassow. It started in 1996 as successor of the Journal of Information Processing and Cybernetics / Elektronische Informationsverarbeitung und Kybernetik; the forerunner journal started in 1965. The main focus of the journal is on a subfield of theoretical computer science, namely on automata theory, formal language theory and combinatorics.
Notes
External Links
*ISSN|1430-189X
* [http://www.jalc.de official homepage]
* [http://www.informatik.uni-trier.de/~ley/db/journals/jalc/ DBLP information]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Outline of combinatorics — See also: Index of combinatorics articles The following outline is presented as an overview of and topical guide to combinatorics: Combinatorics – branch of mathematics concerning the study of finite or countable discrete structures. Contents 1… … Wikipedia
List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is … Wikipedia
Combinatorics on words — Construction of a Thue Morse infinite word Combinatorics on words is a branch of mathematics which applies combinatorics to words and formal languages. The study of combinatorics on words arose independently within several branches of mathematics … Wikipedia
Descriptional Complexity of Formal Systems — Abbreviation DCFS Discipline Automata theory and formal languages Publication details Publisher Electronic Proceedings in Theoretical Computer Science (International) History 1999– … Wikipedia
Mehryar Mohri — is a professor of computer science at the Courant Institute of Mathematical Sciences at New York University known for his work in machine learning, automata theory and algorithms, speech recognition and natural language processing. He received… … Wikipedia
Theoretical computer science — is the collection of topics of computer science that focuses on the more abstract, logical and mathematical aspects of computing, such as the theory of computation, analysis of algorithms, and semantics of programming languages. Although not… … Wikipedia
Hiérarchie de Chomsky — En informatique théorique, en théorie des langages, et en calculabilité, la hiérarchie de Chomsky est une classification des langages formels et des grammaires formelles, décrite par Noam Chomsky en 1956[1]. Cette section ne cite pas suffisamment … Wikipédia en Français
Chomsky–Schützenberger theorem — In formal language theory, the Chomsky–Schützenberger theorem is a statement about the number of words of a given length generated by an unambiguous context free grammar. The theorem provides an unexpected link between the theory of formal… … Wikipedia
Conjunctive grammar — Conjunctive grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context free grammars, with a conjunction operation. Besides explicit conjunction, conjunctive grammars allow… … Wikipedia
Syntactic predicate — A syntactic predicate specifies the syntactic validity of applying a production in a formal grammar and is analogous to a semantic predicate that specifies the semantic validity of applying a production. It is a simple and effective means of… … Wikipedia
