|
Descriptional Complexity Of Formal Systems
DCFS, the International Workshop on Descriptional Complexity of Formal Systems is an annual academic conference in the field of computer science. Beginning with the 2011 edition, the proceedings of the workshop appear in the series Lecture Notes in Computer Science. Already since the very beginning, extended versions of selected papers are published as special issues of the International Journal of Foundations of Computer Science, the Journal of Automata, Languages and Combinatorics, of Theoretical Computer Science, and of Information and Computation In 2002 DCFS was the result of the merger of the workshops DCAGRS (Descriptional Complexity of Automata, Grammars and Related Structures) and FDSR (Formal Descriptions and Software Reliability). The workshop is often collocated with international conferences in related fields, such as ICALP, DLT and CIAA. Topics of the workshop Typical topics include: * various measures of descriptional complexity of automata, grammars, la ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automata Theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word ''automata'' comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite-State Machine (FSM). The figure on the right illustrates a finite-state machine, which is a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the previous state and current input symbol as its arguments. Automata the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circuit Complexity
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits C_,C_,\ldots (see below). Proving lower bounds on size of Boolean circuits computing explicit Boolean functions is a popular approach to separating complexity classes. For example, a prominent circuit class P/poly consists of Boolean functions computable by circuits of polynomial size. Proving that \mathsf\not\subseteq \mathsf would separate P and NP (see below). Complexity classes defined in terms of Boolean circuits include AC0, AC, TC0, NC1, NC, and P/poly. Size and depth A Boolean circuit with n input bits is a directed acyclic graph in which every node (usually called ''gates'' in this context) is either an input node of in-degre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
EATCS
The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer scientists as well as to stimulate cooperation between the theoretical and the practical community in computer science. The major activities of the EATCS are: * Organization of ICALP, the International Colloquium on Automata, Languages and Programming;Brauer, Ute; Brauer, WilfriedEuropean Association for Theoretical Computer Science / About the Association / Silver Jubilee of EATCS/ref> * Publication of the ''Bulletin of the EATCS''; * Publication of a series of monographs and texts on theoretical computer science; * Publication of the journal ''Theoretical Computer Science''; * Publication of the journal '' Fundamenta Informaticae''. EATCS Award Each year, the EATCS Award is awarded in recognition of a distinguished career in theoretical computer science ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Computer Science Conferences
This is a list of academic conferences in computer science. Only conferences with separate articles are included; within each field, the conferences are listed alphabetically by their short names. General * FCRC – Federated Computing Research Conference Algorithms and theory Conferences accepting a broad range of topics from theoretical computer science, including algorithms, data structures, computability, computational complexity, automata theory and formal languages: * CCC - Computational Complexity Conference * FCT – International Symposium on Fundamentals of Computation Theory * FOCS – IEEE Symposium on Foundations of Computer Science * ICALP – International Colloquium on Automata, Languages and Programming * ISAAC – International Symposium on Algorithms and Computation * MFCS – International Symposium on Mathematical Foundations of Computer Science * STACS – Symposium on Theoretical Aspects of Computer Science * STOC – ACM Symposium on Theory of Com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jeffrey Shallit
Jeffrey Outlaw Shallit (born October 17, 1957) is a computer scientist, number theorist, and a noted critic of intelligent design. He is married to Anna Lubiw, also a computer scientist. Early life and education Shallit was born in Philadelphia, Pennsylvania in 1957. His father was Joseph Shallit, a journalist and author, and a son of Jewish immigrants from Vitebsk, Russia (now in Belarus). His mother was Louise Lee Outlaw Shallit, a writer. He has one brother, Jonathan Shallit, a music professor. He earned a Bachelor's degree in mathematics from Princeton University in June 1979. He received a Ph.D., also in mathematics, from the University of California, Berkeley in June 1983. His doctoral thesis was entitled ''Metric Theory of Pierce Expansions'' and his advisor was Manuel Blum. Advocacy Since 1996, Shallit has held the position of Vice-President of Electronic Frontier Canada. In 1997, he gained attention for the publication on the Internet of ''Holocaust Revi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Juhani Karhumäki
Eero Urho Juhani Karhumäki (born 1949) is a Finnish mathematician and theoretical computer scientist known for his contributions to automata theory. He is a professor at the University of Turku. Biography Karhumäki earned his doctorate from the University of Turku in 1976. In 1980–1985, he was a junior researcher of Academy of Finland. Since 1986, he has held teaching positions at the University of Turku, attaining full professorship in 1998. In 1998–2015, Karhumäki was the head of the mathematics department at the University of Turku. He has authored altogether around 200 research papers. Karhumäki is a member of the Finnish Academy of Science and Letters since 2000 and of Academia Europaea since 2006. A festschrift in his honour was published in 2009 as a special issue of Theoretical Computer Science. Research contributions Karhumäki has been a member of the Lothaire group of mathematicians that developed the foundations of combinatorics of words. In 1991, jointly ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chandra Kintala
Chandra Kintala (1948–2009) was a computer science researcher in New Jersey, United States and Bangalore, India from 2006–2009. He worked at Bell Labs in AT&T, Lucent and Avaya in New Jersey, where he and Dr. David Belanger invented a language and a software tool used in AT&T for data analytics on very large databases. With Dr. Yennun Huang, he worked on Software-implemented Fault Tolerance and Software Rejuvenation in the 1990s. He also worked in distributed systems and network software research at Bell Labs. While working at Bell Labs, he held the titles of Adjunct Professor and later Distinguished Industry Professor at Stevens Institute of Technology in New Jersey. India In September 2006, he moved to India as thDirector of Motorola Labsin Bangalore. In August 2008, he joined Yahoo! Labs in Bangalore where he held the position of the Director of System Sciences and Academic Relations in India. Education Kintala had a Ph.D. in Computer Science from Penn State Univ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Giovanni Pighizzini
Giovanni Pighizzini is an Italian theoretical computer scientist known for his work in formal language theory and particularly in state complexity of two-way finite automata. He earned his PhD in 1993 from the University of Milan, where he is a full professor since 2001. Pighizzini serves as the Steering Committee Chair of the annual Descriptional Complexity of Formal Systems academic conference since 2006. Research contributions Pighizzini obtained optimal state complexity tradeoffs between different types of finite automata over a one-letter alphabet, In particular, in his joint paper with Geffert and Mereghetti he presented the first simulation of two-way nondeterministic finite automata by two-way deterministic finite automata using Savitch's theorem, contributing to the 2DFA vs. 2NFA open question. Jointly with Jirásková, he determined state complexity of self-verifying finite automata. He also contributed to the computational complexity theory In theoretical co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Federation For Information Processing
The International Federation for Information Processing (IFIP) is a global organisation for researchers and professionals working in the field of computing to conduct research, develop standards and promote information sharing. Established in 1960 under the auspices of UNESCO, IFIP is recognised by the United Nations and links some 50 national and international societies and academies of science with a total membership of over half a million professionals. IFIP is based in Laxenburg, Austria and is an international, non-governmental organisation that operates on a non-profit basis. Overview IFIP activities are coordinated by 13 Technical Committees (TCs) which are organised into more than 100 Working Groups (WGs), bringing together over 3,500 ICT professionals and researchers from around the world to conduct research, develop standards and promote information sharing. Each TC covers a particular aspect of computing and related disciplines, as detailed below. IFIP actively promo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kolmogorov–Chaitin Complexity
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy. It is named after Andrey Kolmogorov, who first published on the subject in 1963 and is a generalization of classical information theory. The notion of Kolmogorov complexity can be used to state and prove impossibility results akin to Cantor's diagonal argument, Gödel's incompleteness theorem, and Turing's halting problem. In particular, no program ''P'' computing a lower bound for each text's Kolmogorov complexity can return a value essentially larger than ''P'''s own len ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Structural Complexity
In computational complexity theory of computer science, the structural complexity theory or simply structural complexity is the study of complexity classes, rather than computational complexity of individual problems and algorithms. It involves the research of both internal structures of various complexity classes and the relations between different complexity classes. Juris Hartmanis, "New Developments in Structural Complexity Theory" (invited lecture), Proc. 15th International Colloquium on Automata, Languages and Programming, 1988 (ICALP 88), ''Lecture Notes in Computer Science'', vol. 317 (1988), pp. 271-286. History The theory has emerged as a result of (still failing) attempts to resolve the first and still the most important question of this kind, the P = NP problem. Most of the research is done basing on the assumption of P not being equal to NP and on a more far-reaching conjecture that the polynomial time hierarchy of complexity classes is infinite. Important results ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
State Complexity
State complexity is an area of theoretical computer science dealing with the size of abstract automata, such as different kinds of finite automata. The classical result in the area is that simulating an n-state nondeterministic finite automaton by a deterministic finite automaton requires exactly 2^n states in the worst case. Transformation between variants of finite automata Finite automata can be deterministic and nondeterministic, one-way (DFA, NFA) and two-way (2DFA, 2NFA). Other related classes are unambiguous (UFA), self-verifying (SVFA) and alternating (AFA) finite automata. These automata can also be two-way (2UFA, 2SVFA, 2AFA). All these machines can accept exactly the regular languages. However, the size of different types of automata necessary to accept the same language (measured in the number of their states) may be different. For any two types of finite automata, the ''state complexity tradeoff'' between them is an integer function f where f(n) is the least number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
