Implementation and Application of Automata
From MaRDI portal
Publication:5463995
DOI10.1007/b105090zbMath1115.68428DBLPconf/wia/2004OpenAlexW4302765085WikidataQ56387363 ScholiaQ56387363MaRDI QIDQ5463995
Manuel Delgado, José João Morais
Publication date: 17 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105090
Related Items (12)
Obtaining shorter regular expressions from finite-state automata ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Provably Shorter Regular Expressions from Deterministic Finite Automata ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ Computing relative Abelian kernels of finite monoids. ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Optimal Lower Bounds on Regular Expression Size Using Communication Complexity ⋮ Implementation of State Elimination Using Heuristics ⋮ Short Regular Expressions from Finite Automata: Empirical Results ⋮ Small Extended Expressions for Acyclic Automata ⋮ Automata and rational expressions ⋮ Descriptional complexity of regular languages
Uses Software
This page was built for publication: Implementation and Application of Automata
