Automata Implementation [[electronic resource] ] : 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers / / edited by Oliver Boldt, Helmut Jürgensen |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (VII, 189 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Programming languages (Electronic computers)
Mathematical logic Artificial intelligence Computers Pattern recognition Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Artificial Intelligence Computation by Abstract Devices Mathematical Logic and Formal Languages Pattern Recognition |
ISBN | 3-540-45526-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | FA Minimisation Heuristics for a Class of Finite Languages -- SEA: A Symbolic Environment for Automata Theory -- Analysis of Reactive Systems with n Timers -- Animation of the Generation and Computation of Finite Automata for Learning Software -- Metric Lexical Analysis -- State Complexity of Basic Operations on Finite Languages -- Treatment of Unknown Words -- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images -- Thompson Digraphs: A Characterization -- Finite Automata Encoding Geometric Figures -- Compressed Storage of Sparse Finite-State Transducers -- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing -- Multiset Processing by Means of Systems of Finite State Transducers -- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits -- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata -- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. |
Record Nr. | UNISA-996465927003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automata Implementation : 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers / / edited by Oliver Boldt, Helmut Jürgensen |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (VII, 189 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Programming languages (Electronic computers)
Mathematical logic Artificial intelligence Computers Pattern recognition Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Artificial Intelligence Computation by Abstract Devices Mathematical Logic and Formal Languages Pattern Recognition |
ISBN | 3-540-45526-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | FA Minimisation Heuristics for a Class of Finite Languages -- SEA: A Symbolic Environment for Automata Theory -- Analysis of Reactive Systems with n Timers -- Animation of the Generation and Computation of Finite Automata for Learning Software -- Metric Lexical Analysis -- State Complexity of Basic Operations on Finite Languages -- Treatment of Unknown Words -- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images -- Thompson Digraphs: A Characterization -- Finite Automata Encoding Geometric Figures -- Compressed Storage of Sparse Finite-State Transducers -- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing -- Multiset Processing by Means of Systems of Finite State Transducers -- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits -- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata -- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. |
Record Nr. | UNINA-9910143614603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Descriptional Complexity of Formal Systems [[electronic resource] ] : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings / / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XII, 366 p. 59 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
ISBN | 3-319-09704-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of objects, state explosion-like phenomena -- Circuit complexity of Boolean functions and related measures -- Resource-bounded or structure-bounded environments -- Frontiers between decidability and undecidability -- Universality and reversibility -- Structural complexity -- Formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages) -- Nature-motivated (bio-inspired) architectures and unconventional models of computing -- Complexity aspects of combinatorics on words -- Kolmogorov complexity. |
Record Nr. | UNISA-996198266703316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Descriptional Complexity of Formal Systems : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings / / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XII, 366 p. 59 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
ISBN | 3-319-09704-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of objects, state explosion-like phenomena -- Circuit complexity of Boolean functions and related measures -- Resource-bounded or structure-bounded environments -- Frontiers between decidability and undecidability -- Universality and reversibility -- Structural complexity -- Formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages) -- Nature-motivated (bio-inspired) architectures and unconventional models of computing -- Complexity aspects of combinatorics on words -- Kolmogorov complexity. |
Record Nr. | UNINA-9910484146803321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|