|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 823 occurrences of 477 keywords
|
|
|
Results
Found 2071 publication records. Showing 2071 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
69 | Zhe Dang, Oscar H. Ibarra, Jianwen Su |
Composability of Infinite-State Activity Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 377-388, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
68 | Howard Straubing, Denis Thérien |
Finite automata and computational complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 199-233, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
68 | Juraj Hromkovic, Georg Schnitger |
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 439-451, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
descriptional complexity of regular languages, Finite automata, nondeterminism |
65 | Helmut Jürgensen, Ludwig Staiger |
Finite Automata Encoding Geometric Figures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIA ![In: Automata Implementation, 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999, Revised Papers, pp. 101-108, 1999, Springer, 3-540-42812-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
65 | Rusins Freivalds |
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 931-942, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
63 | Chandra M. R. Kintala, Detlef Wotschke |
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings, pp. 291-305, 1986, Springer, 3-540-16078-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
60 | Randy Smith, Cristian Estan, Somesh Jha |
XFA: Faster Signature Matching with Extended Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SP ![In: 2008 IEEE Symposium on Security and Privacy (SP 2008), 18-21 May 2008, Oakland, California, USA, pp. 187-201, 2008, IEEE Computer Society, 978-0-7695-3168-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
intrusion detection, regular expressions, finite automata, signature matching |
56 | Andris Ambainis, Ashwin Nayak 0001, Amnon Ta-Shma, Umesh V. Vazirani |
Dense quantum coding and quantum finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(4), pp. 496-511, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Automaton size, quantum computation, encoding, communication complexity, finite automata, quantum communication |
55 | Ville Laurikari |
NFAs with Tagged Transitions, Their Conversion to Deterministic Automata and Application to Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000, pp. 181-187, 2000, IEEE Computer Society, 0-7695-0746-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
tagged transitions, automata conversion, input string position tracking, last-use tracking, nondeterministic Mealy machines, string processing, substring addressing, lookahead operator, regular expressions, finite automata, formal semantics, deterministic automata, nondeterministic finite automata |
54 | Bernard Boigelot, Julien Brusten, Véronique Bruyère |
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, pp. 112-123, 2008, Springer, 978-3-540-70582-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
54 | Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
Measures of Nondeterminism in Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 199-210, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
limited ambiguity, communication complexity, finite automata, nondeterminism, descriptional complexity |
53 | Rusins Freivalds |
Hamming, Permutations and Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings, pp. 18-29, 2007, Springer, 978-3-540-74870-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
53 | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski |
Quantum Finite Multitape Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27 - December 4, 1999, Proceedings, pp. 340-348, 1999, Springer, 3-540-66694-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
52 | Andris Ambainis |
The Complexity of Probabilistic versus Deterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 233-238, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
the complexity of finite automata, probabilistic finite automata, Automata theory |
52 | Borivoj Melichar, Jan Skryja |
On the Size of Deterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers, pp. 202-213, 2001, Springer, 3-540-00400-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
51 | Jean-Camille Birget |
Basic techniques for two-way finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 56-64, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
51 | Kosaburo Hashiguchi |
Relative star height, star height and finite automata with distance functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 74-88, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
51 | Jean Berstel |
Finite automata and rational languages. An introduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 2-14, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
50 | Wolfgang Thomas |
Automata and quantifier hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 104-119, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
49 | Lynette van Zijl |
Supernondeterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers, pp. 274-288, 2001, Springer, 3-540-00400-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
49 | Ronald L. Rivest, Robert E. Schapire |
Diversity-Based Inference of Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(3), pp. 555-589, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
diversity-based representation, permutation automata, finite automata, learning theory, inductive inference |
49 | Salvatore La Torre, Aniello Murano, Margherita Napoli |
Weak Muller Acceptance Conditions for Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, Third International Workshop, VMCAI 2002, Venice, Italy, January 21-22, 2002, Revised Papers, pp. 240-254, 2002, Springer, 3-540-43631-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
47 | Junna Kuramochi, Yasubumi Sakakibara |
Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers., pp. 193-202, 2005, Springer, 3-540-34161-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Andris Ambainis, Rusins Freivalds |
1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 332-341, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
quantum computation, finite automata |
45 | Colin de la Higuera |
Learning Stochastic Finite Automata from Experts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference, 4th International Colloquium, ICGI-98, Ames, Iowa, USA, July 12-14, 1998, Proceedings, pp. 79-89, 1998, Springer, 3-540-64776-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
identification with probability one, polynomial learning, stochastic deterministic finite automata, grammatical inference |
45 | Markus Holzer 0001, Martin Kutrib |
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings, pp. 1-16, 2008, Springer, 978-3-540-70843-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Randy Smith, Cristian Estan, Somesh Jha, Ida Sri Rejeki Siahaan |
Fast Signature Matching Using Extended Finite Automaton (XFA). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISS ![In: Information Systems Security, 4th International Conference, ICISS 2008, Hyderabad, India, December 16-20, 2008. Proceedings, pp. 158-172, 2008, Springer, 978-3-540-89861-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens |
The Regular Real-Time Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 580-591, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
43 | Sam M. Kim, Robert McNaughton, Robert McCloskey |
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(10), pp. 1087-1093, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
local testability, locally testable language, nonnegative integer, prefix, suffix, computational complexity, polynomial time algorithm, formal languages, finite automata, word, deterministic finite automata, deterministic automata, substrings |
43 | Thomas L. Casavant, Jon G. Kuhl |
A Communicating Finite Automata Approach to Modeling Distributed Computation and Its Application to Distributed Decision-Making. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(5), pp. 628-639, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
communicating finite automata approach, standard specification mechanism, distribution scheduling algorithms, scheduling, modeling, formal specification, distributed computation, directed graphs, directed graphs, finite automata, distributed decision-making |
43 | Hanlin Lu, Sheng Yu 0001 |
Are Statecharts Finite Automata? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings, pp. 258-261, 2009, Springer, 978-3-642-02978-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
interaction machines, statecharts, finite automata |
42 | Attila Kondacs, John Watrous |
On the Power of Quantum Finite State Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 66-75, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
quantum finite state automata, non-regular language, finite automata, finite state automata, regular languages |
42 | Suna Bensch, Henning Bordihn, Markus Holzer 0001, Martin Kutrib |
Deterministic Input-Reversal and Input-Revolving Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 113-124, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Xian Xu 0001 |
P Systems and Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISIS ![In: First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS-2007), Vienna, Austria, 10-12 April 2007, pp. 135-138, 2007, IEEE Computer Society, 0-7695-2823-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Andreas Malcher |
Minimizing Finite Automata Is Computationally Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings, pp. 386-397, 2003, Springer, 3-540-40434-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Andrei Paun, Mihaela Paun |
State and Transition Complexity of Watson-Crick Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings, pp. 409-420, 1999, Springer, 3-540-66412-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
42 | Chenguang Luo |
From Word Automata to Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICYCS ![In: Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008, pp. 94-99, 2008, IEEE Computer Society, 978-0-7695-3398-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Christopher L. Hayes, Yan Luo |
DPICO: a high speed deep packet inspection engine using compact finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2007 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2007, Orlando, Florida, USA, December 3-4, 2007, pp. 195-203, 2007, ACM, 978-1-59593-945-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
FPGA, intrusion detection, finite automata, content addressable memory |
41 | Boguslaw Schreyer, Wojciech Wawrzynski |
Finite automata models for CS problem with binary semaphore. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2006, Bologna, Italy, June 26-28, 2006, pp. 330, 2006, ACM, 1-59593-055-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
computer science education, finite automata, process synchronization |
41 | Carlo Mereghetti, Beatrice Palano |
Upper Bounds on the Size of One-Way Quantum Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings, pp. 123-135, 2001, Springer, 3-540-42672-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
quantum finite automata, periodic events and languages |
41 | Christoph C. Michael, Anup K. Ghosh |
Using Finite Automata to Mine Execution Data for Intrusion Detection: A Preliminary Report. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Recent Advances in Intrusion Detection ![In: Recent Advances in Intrusion Detection, Third International Workshop, RAID 2000, Toulouse, France, October 2-4, 2000, Proceedings, pp. 66-79, 2000, Springer, 3-540-41085-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
data mining, machine learning, finite automata, feature detection |
40 | Henning Bordihn, Markus Holzer 0001, Martin Kutrib |
Hybrid Extended Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, pp. 34-45, 2006, Springer, 3-540-37213-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Till Tantau |
Comparing Verboseness for Finite Automata and Turing Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 37(1), pp. 95-109, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Till Tantau |
Comparing Verboseness for Finite Automata and Turing Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 465-476, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Mark R. Headington |
Introducing finite automata in the first course. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 19th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1988, Atlanta, Georgia, USA, February 25-26, 1988, pp. 163-167, 1988, ACM, 978-0-89791-256-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
40 | Giusi Castiglione, Antonio Restivo, Marinella Sciortino |
Hopcroft's Algorithm and Cyclic Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 172-183, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys |
Power of Cooperation and Multihead Finite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 896-907, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
40 | Brett D. Estrade, A. Louise Perkins, John M. Harris |
Explicitly Parallel Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS (1) ![In: Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 1, pp. 402-409, 2006, IEEE Computer Society, 0-7695-2581-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Jürgen Dassow, György Vaszil |
P Finite Automata and Regular Languages over Countably Infinite Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Membrane Computing ![In: Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers, pp. 367-381, 2006, Springer, 3-540-69088-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Jean-Eric Pin (eds.) |
Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![Springer, 3-540-51631-X The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
39 | Antonio Restivo |
Codes and Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 186-198, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Maxime Crochemore |
Algorithms and automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 166-175, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Marcel Paul Schützenberger |
Décomposition polynomiale des fonctions rationnelles (English summary). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 25-33, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Imre Simon |
Properties of factorization forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 65-72, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Pascal Weil |
Concatenation product: a survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 120-137, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Irène Guessarian |
A characterization of fair computations of finite state SCCS processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 234-248, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Howard Straubing |
The wreath product and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 15-24, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | John C. Meakin |
Automata and the word problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 89-103, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Aldo de Luca, Stefano Varricchio |
A finiteness condition for semigroups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 138-147, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Jorge Almeida 0001 |
Equations for pseudovarieties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 148-164, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Jean-Eric Pin |
Relational morphisms, transductions and operations on languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 34-55, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Didier Vergamini |
Verification of distributed systems: an experiment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 249-259, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | G. Rauzy |
Numbers and automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 176-185, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Emmanuel Jeandel |
Topological Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 389-398, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
ProbabilisticAutomata, Formal Languages, Finite Automata, Quantum Automata |
39 | Richard Mayr |
On the Complexity of Bisimulation Problems for Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 474-488, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
verification, complexity, bisimulation, Pushdown automata |
38 | Thomas L. Casavant, Jon G. Kuhl |
Effects of Response and Stability on Scheduling in Distributed Computing Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(11), pp. 1578-1588, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
user-defined objective, communicating finite automata models, first-order metric, scheduling, scheduling, load balancing, stability, distributed processing, dynamic systems, finite automata, response, distributed computing systems |
38 | Korakot Prachumrak |
Weighted Finite Automata encoding over Thai language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 697-701, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Thai language, weighted finite automata, data compression, text |
38 | Attila Csenki |
Flowgraph Models in Reliability and Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 57(2), pp. 355-359, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Jiming Ma, Haibin Zhu, Wenqian Shang |
The Construction Approach of Regular Expressions from Finite Automata Including Multi-Node Loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ICCI ![In: Proceedings of the Firth IEEE International Conference on Cognitive Informatics, ICCI 2006, July 17-19, Beijing, China, pp. 771-776, 2006, IEEE Computer Society, 1-4244-0475-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | German Tischler |
Parametric Weighted Finite Automata for Figure Drawing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 259-268, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Till Tantau |
Towards a Cardinality Theorem for Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 625-636, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Pei-Chi Wu, Feng-Jian Wang, Kai-Ru Young |
Scanning regular languages by dual finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 27(4), pp. 12-16, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
38 | Manuel Baclet, Claire Pagetti |
Around Hopcroft's Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, pp. 114-125, 2006, Springer, 3-540-37213-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hopcroft’s algorithm, Finite automata, minimization |
38 | Lucian Ilie, Roberto Solis-Oba, Sheng Yu 0001 |
Reducing the Size of NFAs by Using Equivalences and Preorders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, pp. 310-321, 2005, Springer, 3-540-26201-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
state complexity, finite automata, equivalences, regular expression matching, preorders |
38 | Alberto Bertoni, Carlo Mereghetti, Beatrice Palano |
Quantum Computing: 1-Way Quantum Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings, pp. 1-20, 2003, Springer, 3-540-40434-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
quantum finite automata, formal power series |
38 | Lucian Ilie, Sheng Yu 0001 |
Algorithms for Computing Small NFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 328-340, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
follow relations, invariant equivalences, algorithms, regular expressions, positions, partial derivatives, quotients, nondeterministic finite automata |
37 | Ren-ji Tao |
Invertibility of Linear Finite Automata Over a Ring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 489-501, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
36 | Xiaowei Zhang, Yongming Li 0001 |
Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 13(6), pp. 611-616, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Intuitionistic fuzzy recognizer, Intuitionistic fuzzy finite automaton, Deterministic intuitionistic fuzzy finite automaton, Intuitionistic fuzzy language |
36 | Michela Becchi, Patrick Crowley |
Extending finite automata to efficiently match Perl-compatible regular expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT ![In: Proceedings of the 2008 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2008, Madrid, Spain, December 9-12, 2008, pp. 25, 2008, ACM, 978-1-60558-210-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Klaus Reinhardt |
The Complexity of Translating Logic to Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automata, Logics, and Infinite Games ![In: Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], pp. 231-238, 2001, Springer, 3-540-00388-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev |
Quantum versus Probabilistic One-Way Finite Automata with Counter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings, pp. 181-190, 2001, Springer, 3-540-42912-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Manfred Droste, Karin Quaas |
A Kleene-Schützenberger Theorem for Weighted Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 142-156, 2008, Springer, 978-3-540-78497-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Li Sheng, Yongming Li 0001 |
Regular grammars with truth values in lattice-ordered monoid and their languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 10(2), pp. 79-86, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Fuzzy finite automata, Fuzzy regular grammar, Fuzzy regular language, Lattice-ordered monoid |
36 | Pavol Duris, Juraj Hromkovic, Katsushi Inoue |
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 214-228, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Las Vegas randomization, two-dimensional finite automata, nondeterminism |
36 | Takeshi Koshiba |
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 268-278, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Marats Golovkins, Maksim Kravtsev |
Probabilistic Reversible Automata and Quantum Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 574-583, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Bernard Boigelot, Stéphane Rassart, Pierre Wolper |
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 152-163, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Manfred Droste, Guo-Qiang Zhang 0001 |
Rational Transformations of Formal Power Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 555-566, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
rational languages, recognizable languages, weighted finite automata, Formal power series |
34 | Anup Kumar Keshri, Rakesh Kumar Sinha, Rajesh Hatwal, Barda Nand Das |
Epileptic Spike Recognition in Electroencephalogram Using Deterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Medical Syst. ![In: J. Medical Syst. 33(3), pp. 173-179, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Epileptic spike, Electroencephalogram, Automated system, Deterministic finite automata |
34 | Piti Piyachon, Yan Luo |
Design of high performance pattern matching engine through compact deterministic finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 45th Design Automation Conference, DAC 2008, Anaheim, CA, USA, June 8-13, 2008, pp. 852-857, 2008, ACM, 978-1-60558-115-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
pattern matching, content addressable memory, deterministic finite automata |
34 | Zhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel |
An Inference Implementation Based on Extended Weighted Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSC ![In: 24th Australasian Computer Science Conference (ACSC 2001), 29 January - 1 February 2001, Gold Coast, Queensland, Australia, pp. 100-108, 2001, IEEE Computer Society, 0-7695-0963-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Weighted finite automata, image compression, self-similarity, inference algorithm |
34 | Klaus Brouwer, Wolfgang Gellerich, Erhard Plödereder |
Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 7th International Conference, CC'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, pp. 1-15, 1998, Springer, 3-540-64304-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Finite Automata, Lexical Analysis, Scanner, Run-time Efficiency |
34 | Ullrich Hafner |
Image and Video Coding with Weighted Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (1) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 326-329, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
rate distortion constrained approximation, weighted finite automata, picture sequences, temporal redundancies removal, spatial redundancies removal, mathematical structure, efficient hybrid compression methods, coding algorithm, coarse linear combination, inter-frame coding, intra-frame coding, H.263 video coding standard, adaptive image partitioning, prediction, image coding, image coding, motion compensation, self similarities, entropy coding |
34 | Pavlos Antoniou, Jan Holub 0001, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo |
Finding Common Motifs with Gaps Using Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, pp. 69-77, 2006, Springer, 3-540-37213-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger |
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 117-128, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Las Vegas, communication complexity, automata, determinism, computational and structural complexity |
33 | Kyubum Wee, Byungeun Moon |
Automatic Generation of Finite State Automata for Detecting Intrusions Using System Call Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMM-ACNS ![In: Computer Network Security, Second International Workshop on Mathematical Methods, Models, and Architectures for Computer Network Security, MMM-ACNS 2003, St. Petersburg, Russia, September 21-23, 2003, Proceedings, pp. 206-216, 2003, Springer, 3-540-40797-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Clifford A. Reiter |
Infix, Cut and Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the 1995 International Conference on Applied Programming Languages, APL 1995, San Antonio, Texas, USA, June 4-8, 1995., pp. 162-170, 1995, ACM, 0-89791-722-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
APL, J |
33 | Zamir Bavel |
Structure and Transition-Preserving Functions of Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 15(1), pp. 135-158, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
|
33 | Feng Bao 0004, Yoshihide Igarashi |
A Randomized Algorithm to Finite Automata Public Key Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 678-686, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Hing Leung |
On Finite Automata with Limited Nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 35(7), pp. 595-624, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2071 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|