The decidability of a mapping problem for generalized sequential machines with final states

DOI10.1016/S0022-0000(75)80040-7zbMath0302.94022OpenAlexW1992576498MaRDI QIDQ1216390

Kenneth B. Salomon

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80040-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

Bijective sequential mappings of a free monoid onto another ⋮ String and graph grammar characterizations of bounded regular languages

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• General properties of star height of regular events
• Some Recursively Unsolvable Problems in ALGOL-Like Languages
• Bounded Algol-Like Languages
• Bounded Regular Sets
• Finite-Turn Pushdown Automata
• Partial algorithm problems for context free languages
• Classification of formal languages by functional binary transductions
• Studies in abstract families of languages
• Structural complexity of context-free languages

This page was built for publication: The decidability of a mapping problem for generalized sequential machines with final states