Transforming Lattices Into Non-Deterministic Automata With Optional Null Arcs

doi 10.3115/980691.980766
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Processing XML Streams With Deterministic Automata and Stream Indexes

ACM Transactions on Database Systems
Information Systems
2004English

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Homological Properties of Non-Deterministic Branchings of Mergings in Higher Dimensional Automata

Homology, Homotopy and Applications
Mathematics
2005English

Deterministic Half Automata and Boolean Mappings

Journal of Computer Science Technology Updates
2015English

Deterministic Automata Simulation, Universality and Minimality

Annals of Pure and Applied Logic
Logic
1997English

Random Generation of Deterministic Tree (Walking) Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Rabin-Mostowski Index Problem: A Step Beyond Deterministic Automata

2013English

Complexity in Phase Transforming Pin-Jointed Auxetic Lattices

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy