Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata implementation : third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998 : revised papers / / Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi (eds.)
| Automata implementation : third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998 : revised papers / / Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi (eds.) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (253 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Machine theory |
| ISBN |
1-280-94926-0
9786610949267 3-540-48057-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Extended Context-Free Grammars and Normal Form Algorithms -- On Parsing LL-Languages -- On Parsing and Condensing Substrings of LR Languages in Linear Time -- Minimal Cover-Automata for Finite Languages -- Determinization of Glushkov Automata -- Implementing Reversed Alternating Finite Automaton (r-AFA) Operations -- Operations on DASG -- Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching -- The Syntactic Prediction with Token Automata: Application to HandiAS System -- Bi-directional Automata to Extract Complex Phrases from Texts -- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs -- Using Acceptors as Transducers -- Proving Sequential Function Chart Programs Using Automata -- Automata and Computational Probabilities -- Automata and Binary Decision Diagrams -- Operations over Automata with Multiplicities -- Paging Automata -- On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment -- The Finite State Automata’s Design Patterns -- Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set -- Autographe: A Graphical Version of Automate -- INTEX 4.1 for Windows: A Walkthrough. |
| Record Nr. | UNINA-9910143450703321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata implementation : third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998 : revised papers / / Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi (eds.)
| Automata implementation : third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998 : revised papers / / Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi (eds.) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (253 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Machine theory |
| ISBN |
1-280-94926-0
9786610949267 3-540-48057-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Extended Context-Free Grammars and Normal Form Algorithms -- On Parsing LL-Languages -- On Parsing and Condensing Substrings of LR Languages in Linear Time -- Minimal Cover-Automata for Finite Languages -- Determinization of Glushkov Automata -- Implementing Reversed Alternating Finite Automaton (r-AFA) Operations -- Operations on DASG -- Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching -- The Syntactic Prediction with Token Automata: Application to HandiAS System -- Bi-directional Automata to Extract Complex Phrases from Texts -- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs -- Using Acceptors as Transducers -- Proving Sequential Function Chart Programs Using Automata -- Automata and Computational Probabilities -- Automata and Binary Decision Diagrams -- Operations over Automata with Multiplicities -- Paging Automata -- On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment -- The Finite State Automata’s Design Patterns -- Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set -- Autographe: A Graphical Version of Automate -- INTEX 4.1 for Windows: A Walkthrough. |
| Record Nr. | UNISA-996465849903316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formaliser les langues avec l’ordinateur : de INTEX à Nooj / / Svetla Koeva, Denis Maurel, Max Silberztein
| Formaliser les langues avec l’ordinateur : de INTEX à Nooj / / Svetla Koeva, Denis Maurel, Max Silberztein |
| Autore | Ahmad Khurshid |
| Pubbl/distr/stampa | Besançon, : Presses universitaires de Franche-Comté, 2020 |
| Descrizione fisica | 1 online resource (442 p.) |
| Altri autori (Persone) |
BaptistaJorge
BlancoXavier BoyaciogluNisan CatenaAngels ChevalierGisèle DarmoniStéfan DibattistaLiborio Di PaloLucia DonabedianAnaïd DouyereMagaly FaíscaLuís FuchsManuel FuentesSandrine FuianoLucilla GaborKata GazeauMarie-Aimée KoevaSvetla KrstevCvetana LepetitXavier LessevaSvetlozara LongMichael MaurelDenis MontessuitNicolas MotaCristina NagyViktor NeveolAurélie Pavlovic-LazeticGordana PetrovskiAleksandar RogozanAlexandrina RousselotFrançois SeelbachDieter SilberzteinMax TraboulsiHayssam TutinAgnès VajdaPéter VaradiTamás VitasDuško ZellaguiKatia |
| Collana | Les Cahiers de la MSHE Ledoux |
| Soggetto topico | Computational linguistics |
| Soggetto non controllato |
informatique linguistique
linguistique de corpus traitement automatique des langues naturelles |
| ISBN | 2-84867-817-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Altri titoli varianti |
Formaliser les langues avec l'ordinateur
Formaliser les langues avec l’ordinateur Formaliser les langues avec l’ordinateur |
| Record Nr. | UNINA-9910496035403321 |
Ahmad Khurshid
|
||
| Besançon, : Presses universitaires de Franche-Comté, 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011, Revised Selected Papers / / edited by Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel
| Implementation and Application of Automata [[electronic resource] ] : 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011, Revised Selected Papers / / edited by Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIII, 299 p. 45 illus., 18 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Machine theory Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Theory of Computation Formal Languages and Automata Theory Discrete Mathematics in Computer Science Computer Science Logic and Foundations of Programming Data Science |
| ISBN | 3-642-22256-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465769503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers / / edited by Jean-Marc Champarnaud, Denis Maurel
| Implementation and Application of Automata : 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers / / edited by Jean-Marc Champarnaud, Denis Maurel |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XI, 310 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Computer logic Mathematical logic Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-44977-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Edit-Distance of Weighted Automata -- Technical Contributions -- p-Subsequentiable Transducers -- Bidirectional Push Down Automata -- Finite Automata and Non-self-Embedding Grammars -- Simulation of Gate Circuits in the Algebra of Transients -- The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata -- Regex and Extended Regex -- Prime Decompositions of Regular Prefix Codes -- Implementation of Dictionaries via Automata and Decision Trees -- Feedback-Free Circuits in the Algebra of Transients -- On Minimizing Cover Automata for Finite Languages in O(n log n) Time -- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers -- Finite State Lazy Operations in NLP -- State Complexity of Basic Operations on Nondeterministic Finite Automata -- Adaptive Automata - A Revisited Proposal -- Efficient Automaton-Based Recognition for Linear Conjunctive Languages -- Syntactic Semiring and Language Equations -- Reduced Power Automata -- A Polynomial Time Algorithm for Left [Right] Local Testability -- Whale Calf, a Parser Generator for Conjunctive Grammars -- automata, a Hybrid System for Computational Automata Theory -- A Package TESTAS for Checking Some Kinds of Testability -- DAWG versus Suffix Array -- On Predictive Parsing and Extended Context-Free Grammars -- Star Normal Form, Rational Expressions, and Glushkov WFAs Properties -- Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings -- Term Validation of Distributed Hard Real-Time Applications -- Common Subsequence Automaton -- Searching for Asymptotic Error Repair -- Abstracts -- Automata-Based Representations for Arithmetic Constraints in Automated Verification -- On the Implementation of Compact DAWG’s -- Dynamic Programming — NFA Simulation -- Deterministic Parsing of Cyclic Strings. |
| Altri titoli varianti | CIAA'02 |
| Record Nr. | UNINA-9910143877903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata : 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers / / edited by Jean-Marc Champarnaud, Denis Maurel
| Implementation and Application of Automata : 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers / / edited by Jean-Marc Champarnaud, Denis Maurel |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XI, 310 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Computer logic Mathematical logic Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-44977-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Edit-Distance of Weighted Automata -- Technical Contributions -- p-Subsequentiable Transducers -- Bidirectional Push Down Automata -- Finite Automata and Non-self-Embedding Grammars -- Simulation of Gate Circuits in the Algebra of Transients -- The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata -- Regex and Extended Regex -- Prime Decompositions of Regular Prefix Codes -- Implementation of Dictionaries via Automata and Decision Trees -- Feedback-Free Circuits in the Algebra of Transients -- On Minimizing Cover Automata for Finite Languages in O(n log n) Time -- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers -- Finite State Lazy Operations in NLP -- State Complexity of Basic Operations on Nondeterministic Finite Automata -- Adaptive Automata - A Revisited Proposal -- Efficient Automaton-Based Recognition for Linear Conjunctive Languages -- Syntactic Semiring and Language Equations -- Reduced Power Automata -- A Polynomial Time Algorithm for Left [Right] Local Testability -- Whale Calf, a Parser Generator for Conjunctive Grammars -- automata, a Hybrid System for Computational Automata Theory -- A Package TESTAS for Checking Some Kinds of Testability -- DAWG versus Suffix Array -- On Predictive Parsing and Extended Context-Free Grammars -- Star Normal Form, Rational Expressions, and Glushkov WFAs Properties -- Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings -- Term Validation of Distributed Hard Real-Time Applications -- Common Subsequence Automaton -- Searching for Asymptotic Error Repair -- Abstracts -- Automata-Based Representations for Arithmetic Constraints in Automated Verification -- On the Implementation of Compact DAWG’s -- Dynamic Programming — NFA Simulation -- Deterministic Parsing of Cyclic Strings. |
| Altri titoli varianti | CIAA'02 |
| Record Nr. | UNISA-996465479603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||