LANGAGE

swMATH501MaRDI QIDQ13257FDOQ13257

Author name not available (Why is that?)

Official website: http://webcache.googleusercontent.com/search?q=cache:3ofh26hjGYMJ:car0n.free.fr/Pascal-Caron_files/PUBLI/WIA97.ps.gz+langage+package&cd=4&hl=de&ct=clnk&gl=de

Described by source

• LANGAGE: A Maple package for automaton characterization of regular languages

Cited In (49)

• Execution monitoring enforcement under memory-limitation constraints
• Small Extended Expressions for Acyclic Automata
• A characterization of Thompson digraphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of Glushkov automata
• Multi-tilde-bar expressions and their automata
• Weak inclusion for XML types
• Reducing the time complexity of testing for local threshold testability
• Acyclic networks maximizing the printing complexity
• Reducing the time complexity of testing for local threshold testability
• Some properties of Ising automata
• How expressions can code for automata
• Fuzzy local languages
• Obtaining shorter regular expressions from finite-state automata
• Families of locally testable languages
• Sampling different kinds of acyclic automata using Markov chains
• On the hierarchy of generalizations of one-unambiguous regular languages
• Acyclic automata and small expressions using multi-tilde-bar operators
• Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
• Efficient weighted expressions conversion
• The bottom-up position tree automaton and the father automaton
• Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
• Title not available (Why is that?)
• More concise representation of regular languages by automata and regular expressions
• Derivatives of rational expressions with multiplicity
• Grail
• Title not available (Why is that?)
• TESTAS
• automata
• FAdo
• GUItar
• LANGAGEA
• AG
• Semigroupe
• AMoRE
• Stamina
• Position automaton construction for regular expressions with intersection
• Euler
• Random generation of deterministic acyclic automata using Markov chains
• Beyond operator-precedence grammars and languages
• Title not available (Why is that?)
• Automata and rational expressions
• Series parallel digraphs with loops
• A New Family of Regular Operators Fitting with the Position Automaton Computation
• Multi-tilde Operators and Their Glushkov Automata
• On the descriptional complexity of stateless deterministic ordered restarting automata
• Optimal estimation on the order of local testability of finite automata
• Generalizations of 1-deterministic regular languages

This page was built for software: LANGAGE