|
International Conference On Implementation And Application Of Automata
CIAA, the International Conference on Implementation and Application of Automata is an annual academic conference in the field of computer science. Its purpose is to bring together members of the academic, research, and industrial community who have an interest in the theory, implementation, and application of automata and related structures. There, the conference concerns research on all aspects of implementation and application of automata and related structures, including theoretical aspects. In 2000, the conference grew out of the Workshop on Implementation of Automata (WIA). Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Science+Business Media, Springer Lecture Notes in Computer Science. Extended versions of selected papers of each year's conference alternatingly appear in the journals Theoretical Computer Science (journal), Theoretical Computer Science and International ... [...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 theo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pattern Matching
In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact: "either it will or will not be a match." The patterns generally have the form of either sequences or tree structures. Uses of pattern matching include outputting the locations (if any) of a pattern within a token sequence, to output some component of the matched pattern, and to substitute the matching pattern with some other token sequence (i.e., search and replace). Sequence patterns (e.g., a text string) are often described using regular expressions and matched using techniques such as backtracking. Tree patterns are used in some programming languages as a general tool to process data based on its structure, e.g. C#, F#, Haskell, ML, Python, Ruby, Rust, Scala, Swift and the symbolic mathematics language Mathematica have special syntax for expressing tree p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Science Conferences
A theory is a rational type of abstract thinking about a phenomenon, or the results of such thinking. The process of contemplative and rational thinking is often associated with such processes as observational study or research. Theories may be scientific, belong to a non-scientific discipline, or no discipline at all. Depending on the context, a theory's assertions might, for example, include generalized explanations of how nature works. The word has its roots in ancient Greek, but in modern use it has taken on several related meanings. In modern science, the term "theory" refers to scientific theories, a well-confirmed type of explanation of nature, made in a way consistent with the scientific method, and fulfilling the criteria required by modern science. Such theories are described in such a way that scientific tests should be able to provide empirical support for it, or empirical contradiction ("falsify") of it. Scientific theories are the most reliable, rigorous, and compre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
DBLP
DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI). DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016. All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet. For his work on maintaining DBLP, Michael Ley received an award from the Association for Computing Machinery (ACM) and the VLDB Endowment Special Recognition Award in 1997. Furthermore, he was awarded the ACM Distinguished Service Award for "creating, developing, and curating DBLP" in 2019. ''DBLP'' ... [...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 Comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oscar H
Oscar, OSCAR, or The Oscar may refer to: People * Oscar (given name), an Irish- and English-language name also used in other languages; the article includes the names Oskar, Oskari, Oszkár, Óscar, and other forms. * Oscar (Irish mythology), legendary figure, son of Oisín and grandson of Finn mac Cumhall Places * Oscar, Kentucky, an unincorporated community * Oscar, Louisiana, an unincorporated community * Oscar, Missouri, an unincorporated community * Oscar, Oklahoma, an unincorporated community * Oscar, Pennsylvania, an unincorporated community * Oscar, Texas, an unincorporated community * Oscar, West Virginia, an unincorporated community * Lake Oscar (other) * Oscar Township, Otter Tail County, Minnesota, a civil township Animals * Oscar (bionic cat), a cat that had implants after losing both hind paws * Oscar (bull), #16, (d. 1983) a ProRodeo Hall of Fame bucking bull * Oscar (fish), ''Astronotus ocellatus'' * Oscar (therapy cat), cat purported t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sheng Yu (computer Scientist)
Sheng may refer to: * Sheng (instrument) (笙), a Chinese wind instrument * Sheng (surname) (盛), a Chinese surname * Sheng (Chinese opera), a major role in Chinese opera * Sheng (升), ancient Chinese unit of volume, approximately 1 liter * Sheng pu'er, a type of pu-erh tea * Provinces of China (省), administrative divisions called ''shěng'' in Mandarin * Sheng slang, a slang dialect of the Swahili language See also *Cheng (other) *Zheng (other) Zheng may refer to: *Zheng (surname), Chinese surname (鄭, 郑, ''Zhèng'') *Zheng County, former name of Zhengzhou, capital of Henan, China *Guzheng (), a Chinese zither with bridges *Qin Shi Huang (259 BC – 210 BC), emperor of the Qin Dynasty, ... * Shen (other) {{disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kai Salomaa
Kai T. Salomaa is a Finnish Canadian theoretical computer scientist, known for his numerous contributions to the state complexity of finite automata. His highly cited 1994 joint paper with Yu and Zhuang laid the foundations of the area. He has published over 100 papers in scientific journals on various subjects in formal language theory. Salomaa is a full professor at Queen's University (Kingston, Ontario). Biography Salomaa did his undergraduate studies at the University of Turku, where he has earned his Ph.D. degree in 1989; his dissertation was jointly supervised by Ronald V. Book and Magnus Steinby. In the 1990s, Salomaa worked at the University of Western Ontario. Since 1999, he holds a professor position at Queen's University. His father, Arto Salomaa, is also a distinguished computer scientist with numerous contributions to the fields of automata theory and formal languages In logic, mathematics, computer science, and linguistics, a formal language consists of words ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Derick Wood
Derick Wood (1940–2010) was an English computer scientist who worked for many years as a professor of computer science in Canada and Hong Kong. He was known for his research in automata theory and formal languages, much of which he published in collaboration with Hermann Maurer and Arto Salomaa, and also for his work in computational geometry. Wood was born in 1940 in Lancashire, and educated at the University of Leeds. He earned his PhD from Leeds in 1968 under the supervision of Mike Wells. After postdoctoral studies at the Courant Institute of Mathematical Sciences of New York University, he took his first faculty position at McMaster University in Ontario, Canada. Before joining the Hong Kong University of Science and Technology (HKUST) in 1995, Wood also taught at the University of Waterloo and the University of Western Ontario The University of Western Ontario (UWO), also known as Western University or Western, is a public research university in London, Ontario, Ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Darrell Raymond
Darrell is a given name derived from an English surname, which was derived from Norman-French , originally denoting one who came from Airelle in France. There are no longer any towns in France called Airelle, but is the French word for huckleberry. Darrell may refer to: Sports * Darrell Allums (born 1958), American basketball player * Darrell Armstrong, NBA basketball player * Darrell Campbell, American football defensive tackle on the practice squad of the Chicago Bears * Darrell Clarke, manager of Bristol Rovers football club * Darrell Daniels, American football player * Darrell Evans, former third baseman and first baseman in Major League Baseball * Darrell Green, cornerback for the Washington Redskins from 1983 to 2002 * Darrell Griffith, former NBA basketball player who spent his entire career with the Utah Jazz * Darrell Jackson, American football wide receiver currently playing for the Seattle Seahawks of the National Football League * Darrell Johnson, Major League B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Text Processing
In computing, the term text processing refers to the theory and practice of automating the creation or manipulation of electronic text. ''Text'' usually refers to all the alphanumeric characters specified on the keyboard of the person engaging the practice, but in general ''text'' means the abstraction layer immediately above the standard character encoding of the target text. The term ''processing'' refers to automated (or mechanized) processing, as opposed to the same manipulation done manually. Text processing involves computer commands which invoke content, content changes, and cursor movement, for example to * search and replace * format * generate a processed report of the content of, or * filter a file or report of a text file. The text processing of a regular expression is a virtual editing machine, having a primitive programming language that has named registers (identifiers), and named positions in the sequence of characters comprising the text. Using these, the "text p ... [...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 theo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
