Simple picture processing based on finite automata and regular grammars
From MaRDI portal
Publication:1747512
DOI10.1016/j.jcss.2017.07.011zbMath1390.68393OpenAlexW2802180827MaRDI QIDQ1747512
D. Gnanaraj Thomas, Henning Fernau, Markus L. Schmid, Meenakshi Paramasivan
Publication date: 8 May 2018
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2017.07.011
image processingcharacter recognitionarray grammarsregular matrix languagesboustrophedon finite automataisometric and non-isometric arrayspicture (array) languagesreturning finite automata
Related Items
Two dimensional fuzzy regular languages ⋮ 2D oxide picture languages and their properties ⋮ Lyndon partial words and arrays with applications ⋮ A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages ⋮ Unnamed Item ⋮ Two-dimensional pattern matching against local and regular-like picture languages ⋮ Membership Problem for Two-Dimensional General Row Jumping Finite Automata ⋮ Two-dimensional codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Size complexity of rotating and sweeping automata
- Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids
- Descriptional and computational complexity of finite automata -- a survey
- Non-recursive trade-offs between two-dimensional automata and grammars
- Operator context scanning to support high segmentation rates for real time license plate recognition
- Three-way automata on rectangular types over a one-letter alphabet
- Three-way two-dimensional finite automata with rotated inputs
- A note on the reduction of two-way automata to one-way automata
- On three-way two-dimensional Turing machines
- Three-way tape-bounded two-dimensional Turing machines
- Closure properties of three-way and four-way tape-bounded two-dimensional Turing machines
- Three-way two-dimensional multicounter automata
- Some new results on isotonic array grammars
- Two-dimensional automata with rotated inputs
- A note on decision problems for three-way two-dimensional finite automata
- Some remarks on two-dimensional finite automata
- Complexity of two-dimensional patterns
- Space-filling curves
- Towards optimal locality in mesh-indexings
- Even linear simple matrix languages: formal language properties and grammatical inference.
- New operations and regular expressions for two-dimensional languages over one-letter alphabet
- A survey of two-dimensional automata theory
- Scanning Pictures the Boustrophedon Way
- On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
- Strategies to scan pictures with automata based on Wang tiles
- A Survey on Picture-Walking Automata
- Snake-Deterministic Tiling Systems
- Array automata and operations on array languages
- Characterizations of regular and context-free matrices
- On the generation and use of space‐filling curves
- Some results concerning two-dimensional turing machines and finite automata
- The emptiness problem for intersections of regular languages
- On a family of linear grammars
- On equal matrix languages
- One-Pass Complexity of Digital Picture Properties
- Picture languages with array rewriting rules
- On Weighted Distances on the Khalimsky Grid
This page was built for publication: Simple picture processing based on finite automata and regular grammars
